TSTP Solution File: SET012+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET012+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:17:52 EDT 2023
% Result : Theorem 1.29s 0.73s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 6 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 84 ( 33 ~; 34 |; 10 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 67 ( 3 sgn; 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(difference,axiom,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vUX2tHKXx6/E---3.1_20043.p',difference) ).
fof(thI23,conjecture,
! [X1,X4] :
( subset(X1,X4)
=> equal_set(difference(X4,difference(X4,X1)),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.vUX2tHKXx6/E---3.1_20043.p',thI23) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vUX2tHKXx6/E---3.1_20043.p',subset) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vUX2tHKXx6/E---3.1_20043.p',equal_set) ).
fof(c_0_4,plain,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[difference]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X4] :
( subset(X1,X4)
=> equal_set(difference(X4,difference(X4,X1)),X1) ),
inference(assume_negation,[status(cth)],[thI23]) ).
fof(c_0_6,plain,
! [X10,X11,X12] :
( ( member(X10,X12)
| ~ member(X10,difference(X12,X11)) )
& ( ~ member(X10,X11)
| ~ member(X10,difference(X12,X11)) )
& ( ~ member(X10,X12)
| member(X10,X11)
| member(X10,difference(X12,X11)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X13,X14,X15,X16,X17] :
( ( ~ subset(X13,X14)
| ~ member(X15,X13)
| member(X15,X14) )
& ( member(esk3_2(X16,X17),X16)
| subset(X16,X17) )
& ( ~ member(esk3_2(X16,X17),X17)
| subset(X16,X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])]) ).
fof(c_0_8,negated_conjecture,
( subset(esk1_0,esk2_0)
& ~ equal_set(difference(esk2_0,difference(esk2_0,esk1_0)),esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( member(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk3_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( member(X1,X3)
| member(X1,difference(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_18,plain,
! [X8,X9] :
( ( subset(X8,X9)
| ~ equal_set(X8,X9) )
& ( subset(X9,X8)
| ~ equal_set(X8,X9) )
& ( ~ subset(X8,X9)
| ~ subset(X9,X8)
| equal_set(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_19,plain,
( member(esk3_2(difference(X1,difference(X2,X3)),X4),X3)
| subset(difference(X1,difference(X2,X3)),X4)
| ~ member(esk3_2(difference(X1,difference(X2,X3)),X4),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( member(esk3_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_21,plain,
( member(esk3_2(X1,difference(X2,X3)),X3)
| subset(X1,difference(X2,X3))
| ~ member(esk3_2(X1,difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( member(esk3_2(esk1_0,X1),esk2_0)
| subset(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_23,negated_conjecture,
~ equal_set(difference(esk2_0,difference(esk2_0,esk1_0)),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( member(esk3_2(difference(X1,difference(X1,X2)),X3),X2)
| subset(difference(X1,difference(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( member(esk3_2(esk1_0,difference(esk2_0,X1)),X1)
| subset(esk1_0,difference(esk2_0,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ subset(esk1_0,difference(esk2_0,difference(esk2_0,esk1_0)))
| ~ subset(difference(esk2_0,difference(esk2_0,esk1_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
subset(difference(X1,difference(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( subset(esk1_0,difference(esk2_0,difference(X1,X2)))
| ~ member(esk3_2(esk1_0,difference(esk2_0,difference(X1,X2))),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ subset(esk1_0,difference(esk2_0,difference(esk2_0,esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
subset(esk1_0,difference(esk2_0,difference(X1,esk1_0))),
inference(spm,[status(thm)],[c_0_29,c_0_10]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET012+4 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n007.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 16:16:54 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.vUX2tHKXx6/E---3.1_20043.p
% 1.29/0.73 # Version: 3.1pre001
% 1.29/0.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.29/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.29/0.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.29/0.73 # Starting new_bool_3 with 300s (1) cores
% 1.29/0.73 # Starting new_bool_1 with 300s (1) cores
% 1.29/0.73 # Starting sh5l with 300s (1) cores
% 1.29/0.73 # new_bool_3 with pid 20122 completed with status 0
% 1.29/0.73 # Result found by new_bool_3
% 1.29/0.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.29/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.29/0.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.29/0.73 # Starting new_bool_3 with 300s (1) cores
% 1.29/0.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.29/0.73 # Search class: FGHNF-FFSF22-SFFFFFNN
% 1.29/0.73 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.29/0.73 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.29/0.73 # SAT001_MinMin_p005000_rr_RG with pid 20125 completed with status 0
% 1.29/0.73 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.29/0.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.29/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.29/0.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.29/0.73 # Starting new_bool_3 with 300s (1) cores
% 1.29/0.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.29/0.73 # Search class: FGHNF-FFSF22-SFFFFFNN
% 1.29/0.73 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.29/0.73 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.29/0.73 # Preprocessing time : 0.001 s
% 1.29/0.73 # Presaturation interreduction done
% 1.29/0.73
% 1.29/0.73 # Proof found!
% 1.29/0.73 # SZS status Theorem
% 1.29/0.73 # SZS output start CNFRefutation
% See solution above
% 1.29/0.73 # Parsed axioms : 12
% 1.29/0.73 # Removed by relevancy pruning/SinE : 8
% 1.29/0.73 # Initial clauses : 11
% 1.29/0.73 # Removed in clause preprocessing : 0
% 1.29/0.73 # Initial clauses in saturation : 11
% 1.29/0.73 # Processed clauses : 55
% 1.29/0.73 # ...of these trivial : 0
% 1.29/0.73 # ...subsumed : 5
% 1.29/0.73 # ...remaining for further processing : 50
% 1.29/0.73 # Other redundant clauses eliminated : 0
% 1.29/0.73 # Clauses deleted for lack of memory : 0
% 1.29/0.73 # Backward-subsumed : 0
% 1.29/0.73 # Backward-rewritten : 3
% 1.29/0.73 # Generated clauses : 84
% 1.29/0.73 # ...of the previous two non-redundant : 74
% 1.29/0.73 # ...aggressively subsumed : 0
% 1.29/0.73 # Contextual simplify-reflections : 0
% 1.29/0.73 # Paramodulations : 84
% 1.29/0.73 # Factorizations : 0
% 1.29/0.73 # NegExts : 0
% 1.29/0.73 # Equation resolutions : 0
% 1.29/0.73 # Total rewrite steps : 7
% 1.29/0.73 # Propositional unsat checks : 0
% 1.29/0.73 # Propositional check models : 0
% 1.29/0.73 # Propositional check unsatisfiable : 0
% 1.29/0.73 # Propositional clauses : 0
% 1.29/0.73 # Propositional clauses after purity: 0
% 1.29/0.73 # Propositional unsat core size : 0
% 1.29/0.73 # Propositional preprocessing time : 0.000
% 1.29/0.73 # Propositional encoding time : 0.000
% 1.29/0.73 # Propositional solver time : 0.000
% 1.29/0.73 # Success case prop preproc time : 0.000
% 1.29/0.73 # Success case prop encoding time : 0.000
% 1.29/0.73 # Success case prop solver time : 0.000
% 1.29/0.73 # Current number of processed clauses : 36
% 1.29/0.73 # Positive orientable unit clauses : 10
% 1.29/0.73 # Positive unorientable unit clauses: 0
% 1.29/0.73 # Negative unit clauses : 1
% 1.29/0.73 # Non-unit-clauses : 25
% 1.29/0.73 # Current number of unprocessed clauses: 36
% 1.29/0.73 # ...number of literals in the above : 77
% 1.29/0.73 # Current number of archived formulas : 0
% 1.29/0.73 # Current number of archived clauses : 14
% 1.29/0.73 # Clause-clause subsumption calls (NU) : 114
% 1.29/0.73 # Rec. Clause-clause subsumption calls : 110
% 1.29/0.73 # Non-unit clause-clause subsumptions : 5
% 1.29/0.73 # Unit Clause-clause subsumption calls : 22
% 1.29/0.73 # Rewrite failures with RHS unbound : 0
% 1.29/0.73 # BW rewrite match attempts : 22
% 1.29/0.73 # BW rewrite match successes : 3
% 1.29/0.73 # Condensation attempts : 0
% 1.29/0.73 # Condensation successes : 0
% 1.29/0.73 # Termbank termtop insertions : 1925
% 1.29/0.73
% 1.29/0.73 # -------------------------------------------------
% 1.29/0.73 # User time : 0.007 s
% 1.29/0.73 # System time : 0.001 s
% 1.29/0.73 # Total time : 0.008 s
% 1.29/0.73 # Maximum resident set size: 1760 pages
% 1.29/0.73
% 1.29/0.73 # -------------------------------------------------
% 1.29/0.73 # User time : 0.007 s
% 1.29/0.73 # System time : 0.004 s
% 1.29/0.73 # Total time : 0.011 s
% 1.29/0.73 # Maximum resident set size: 1688 pages
% 1.29/0.73 % E---3.1 exiting
% 1.29/0.73 % E---3.1 exiting
%------------------------------------------------------------------------------