TSTP Solution File: SET924+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET924+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:21:18 EDT 2023
% Result : Theorem 0.17s 0.42s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 2 unt; 0 def)
% Number of atoms : 26 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 28 ( 14 ~; 8 |; 2 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn; 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l34_zfmisc_1,axiom,
! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.dXBXidMIAh/E---3.1_15469.p',l34_zfmisc_1) ).
fof(t67_zfmisc_1,conjecture,
! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.dXBXidMIAh/E---3.1_15469.p',t67_zfmisc_1) ).
fof(c_0_2,plain,
! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[l34_zfmisc_1]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t67_zfmisc_1])]) ).
fof(c_0_4,plain,
! [X7,X8] :
( ( set_difference(singleton(X7),X8) != singleton(X7)
| ~ in(X7,X8) )
& ( in(X7,X8)
| set_difference(singleton(X7),X8) = singleton(X7) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_5,negated_conjecture,
( ( set_difference(singleton(esk1_0),esk2_0) != singleton(esk1_0)
| in(esk1_0,esk2_0) )
& ( set_difference(singleton(esk1_0),esk2_0) = singleton(esk1_0)
| ~ in(esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( set_difference(singleton(X1),X2) != singleton(X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( set_difference(singleton(esk1_0),esk2_0) = singleton(esk1_0)
| ~ in(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( in(esk1_0,esk2_0)
| set_difference(singleton(esk1_0),esk2_0) != singleton(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(X1,X2)
| set_difference(singleton(X1),X2) = singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
~ in(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET924+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n016.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 17:44:51 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.17/0.41 Running first-order theorem proving
% 0.17/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.dXBXidMIAh/E---3.1_15469.p
% 0.17/0.42 # Version: 3.1pre001
% 0.17/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.42 # Starting sh5l with 300s (1) cores
% 0.17/0.42 # new_bool_3 with pid 15549 completed with status 0
% 0.17/0.42 # Result found by new_bool_3
% 0.17/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.42 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.17/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.42 # SAT001_MinMin_p005000_rr_RG with pid 15552 completed with status 0
% 0.17/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.42 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.17/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.42 # Preprocessing time : 0.001 s
% 0.17/0.42 # Presaturation interreduction done
% 0.17/0.42
% 0.17/0.42 # Proof found!
% 0.17/0.42 # SZS status Theorem
% 0.17/0.42 # SZS output start CNFRefutation
% See solution above
% 0.17/0.42 # Parsed axioms : 5
% 0.17/0.42 # Removed by relevancy pruning/SinE : 2
% 0.17/0.42 # Initial clauses : 5
% 0.17/0.42 # Removed in clause preprocessing : 0
% 0.17/0.42 # Initial clauses in saturation : 5
% 0.17/0.42 # Processed clauses : 11
% 0.17/0.42 # ...of these trivial : 0
% 0.17/0.42 # ...subsumed : 0
% 0.17/0.42 # ...remaining for further processing : 11
% 0.17/0.42 # Other redundant clauses eliminated : 0
% 0.17/0.42 # Clauses deleted for lack of memory : 0
% 0.17/0.42 # Backward-subsumed : 1
% 0.17/0.42 # Backward-rewritten : 0
% 0.17/0.42 # Generated clauses : 4
% 0.17/0.42 # ...of the previous two non-redundant : 1
% 0.17/0.42 # ...aggressively subsumed : 0
% 0.17/0.42 # Contextual simplify-reflections : 0
% 0.17/0.42 # Paramodulations : 4
% 0.17/0.42 # Factorizations : 0
% 0.17/0.42 # NegExts : 0
% 0.17/0.42 # Equation resolutions : 0
% 0.17/0.42 # Total rewrite steps : 0
% 0.17/0.42 # Propositional unsat checks : 0
% 0.17/0.42 # Propositional check models : 0
% 0.17/0.42 # Propositional check unsatisfiable : 0
% 0.17/0.42 # Propositional clauses : 0
% 0.17/0.42 # Propositional clauses after purity: 0
% 0.17/0.42 # Propositional unsat core size : 0
% 0.17/0.42 # Propositional preprocessing time : 0.000
% 0.17/0.42 # Propositional encoding time : 0.000
% 0.17/0.42 # Propositional solver time : 0.000
% 0.17/0.42 # Success case prop preproc time : 0.000
% 0.17/0.42 # Success case prop encoding time : 0.000
% 0.17/0.42 # Success case prop solver time : 0.000
% 0.17/0.42 # Current number of processed clauses : 5
% 0.17/0.42 # Positive orientable unit clauses : 0
% 0.17/0.42 # Positive unorientable unit clauses: 0
% 0.17/0.42 # Negative unit clauses : 1
% 0.17/0.42 # Non-unit-clauses : 4
% 0.17/0.42 # Current number of unprocessed clauses: 0
% 0.17/0.42 # ...number of literals in the above : 0
% 0.17/0.42 # Current number of archived formulas : 0
% 0.17/0.42 # Current number of archived clauses : 6
% 0.17/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.42 # Non-unit clause-clause subsumptions : 0
% 0.17/0.42 # Unit Clause-clause subsumption calls : 1
% 0.17/0.42 # Rewrite failures with RHS unbound : 0
% 0.17/0.42 # BW rewrite match attempts : 0
% 0.17/0.42 # BW rewrite match successes : 0
% 0.17/0.42 # Condensation attempts : 0
% 0.17/0.42 # Condensation successes : 0
% 0.17/0.42 # Termbank termtop insertions : 375
% 0.17/0.42
% 0.17/0.42 # -------------------------------------------------
% 0.17/0.42 # User time : 0.002 s
% 0.17/0.42 # System time : 0.002 s
% 0.17/0.42 # Total time : 0.004 s
% 0.17/0.42 # Maximum resident set size: 1600 pages
% 0.17/0.42
% 0.17/0.42 # -------------------------------------------------
% 0.17/0.42 # User time : 0.002 s
% 0.17/0.42 # System time : 0.004 s
% 0.17/0.42 # Total time : 0.006 s
% 0.17/0.42 # Maximum resident set size: 1680 pages
% 0.17/0.42 % E---3.1 exiting
% 0.17/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------