TSTP Solution File: SET928+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET928+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:20 EDT 2023
% Result : Theorem 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 57 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 65 ( 33 ~; 19 |; 10 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 2 sgn; 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t72_zfmisc_1,conjecture,
! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
<=> ( ~ in(X1,X3)
& ~ in(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZfvZDg2zCk/E---3.1_16763.p',t72_zfmisc_1) ).
fof(t83_xboole_1,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.ZfvZDg2zCk/E---3.1_16763.p',t83_xboole_1) ).
fof(t55_zfmisc_1,axiom,
! [X1,X2,X3] :
~ ( disjoint(unordered_pair(X1,X2),X3)
& in(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.ZfvZDg2zCk/E---3.1_16763.p',t55_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.ZfvZDg2zCk/E---3.1_16763.p',commutativity_k2_tarski) ).
fof(t57_zfmisc_1,axiom,
! [X1,X2,X3] :
~ ( ~ in(X1,X2)
& ~ in(X3,X2)
& ~ disjoint(unordered_pair(X1,X3),X2) ),
file('/export/starexec/sandbox/tmp/tmp.ZfvZDg2zCk/E---3.1_16763.p',t57_zfmisc_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
<=> ( ~ in(X1,X3)
& ~ in(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t72_zfmisc_1])]) ).
fof(c_0_6,plain,
! [X17,X18] :
( ( ~ disjoint(X17,X18)
| set_difference(X17,X18) = X17 )
& ( set_difference(X17,X18) != X17
| disjoint(X17,X18) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])]) ).
fof(c_0_7,negated_conjecture,
( ( set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) != unordered_pair(esk1_0,esk2_0)
| in(esk1_0,esk3_0)
| in(esk2_0,esk3_0) )
& ( ~ in(esk1_0,esk3_0)
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = unordered_pair(esk1_0,esk2_0) )
& ( ~ in(esk2_0,esk3_0)
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = unordered_pair(esk1_0,esk2_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X9,X10,X11] :
( ~ disjoint(unordered_pair(X9,X10),X11)
| ~ in(X9,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t55_zfmisc_1])]) ).
fof(c_0_9,plain,
! [X15,X16] : unordered_pair(X15,X16) = unordered_pair(X16,X15),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_10,plain,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = unordered_pair(esk1_0,esk2_0)
| ~ in(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ disjoint(unordered_pair(X1,X2),X3)
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X1,X2,X3] :
~ ( ~ in(X1,X2)
& ~ in(X3,X2)
& ~ disjoint(unordered_pair(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[t57_zfmisc_1]) ).
cnf(c_0_15,negated_conjecture,
( in(esk1_0,esk3_0)
| in(esk2_0,esk3_0)
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) != unordered_pair(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
~ in(esk1_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_18,plain,
( ~ disjoint(unordered_pair(X1,X2),X3)
| ~ in(X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,plain,
! [X12,X13,X14] :
( in(X12,X13)
| in(X14,X13)
| disjoint(unordered_pair(X12,X14),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
( set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = unordered_pair(esk1_0,esk2_0)
| ~ in(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
~ disjoint(unordered_pair(esk1_0,esk2_0),esk3_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_22,plain,
( in(X1,X2)
| in(X3,X2)
| disjoint(unordered_pair(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
~ in(esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : SET928+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 17:23:08 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.ZfvZDg2zCk/E---3.1_16763.p
% 0.18/0.46 # Version: 3.1pre001
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # new_bool_3 with pid 16843 completed with status 0
% 0.18/0.46 # Result found by new_bool_3
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46 # SAT001_MinMin_p005000_rr_RG with pid 16848 completed with status 0
% 0.18/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Theorem
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 9
% 0.18/0.46 # Removed by relevancy pruning/SinE : 2
% 0.18/0.46 # Initial clauses : 10
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 10
% 0.18/0.46 # Processed clauses : 27
% 0.18/0.46 # ...of these trivial : 0
% 0.18/0.46 # ...subsumed : 3
% 0.18/0.46 # ...remaining for further processing : 24
% 0.18/0.46 # Other redundant clauses eliminated : 0
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 2
% 0.18/0.46 # Backward-rewritten : 0
% 0.18/0.46 # Generated clauses : 16
% 0.18/0.46 # ...of the previous two non-redundant : 8
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 2
% 0.18/0.46 # Paramodulations : 16
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 0
% 0.18/0.46 # Total rewrite steps : 0
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 12
% 0.18/0.46 # Positive orientable unit clauses : 0
% 0.18/0.46 # Positive unorientable unit clauses: 1
% 0.18/0.46 # Negative unit clauses : 3
% 0.18/0.46 # Non-unit-clauses : 8
% 0.18/0.46 # Current number of unprocessed clauses: 0
% 0.18/0.46 # ...number of literals in the above : 0
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 12
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 17
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 17
% 0.18/0.46 # Non-unit clause-clause subsumptions : 5
% 0.18/0.46 # Unit Clause-clause subsumption calls : 6
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 8
% 0.18/0.46 # BW rewrite match successes : 8
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 849
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.004 s
% 0.18/0.46 # System time : 0.001 s
% 0.18/0.46 # Total time : 0.005 s
% 0.18/0.46 # Maximum resident set size: 1736 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.005 s
% 0.18/0.46 # System time : 0.003 s
% 0.18/0.46 # Total time : 0.007 s
% 0.18/0.46 # Maximum resident set size: 1680 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------