TSTP Solution File: SET700+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET700+4 : TPTP v8.2.0. Released v2.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:55:21 EDT 2024
% Result : Theorem 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 88 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 90 ( 33 ~; 34 |; 14 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 3 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI34,conjecture,
! [X1,X2,X4] :
( ( subset(X1,X4)
& subset(X2,X4) )
=> ( subset(X1,X2)
<=> subset(intersection(X1,difference(X4,X2)),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI34) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(difference,axiom,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',difference) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X4] :
( ( subset(X1,X4)
& subset(X2,X4) )
=> ( subset(X1,X2)
<=> subset(intersection(X1,difference(X4,X2)),X2) ) ),
inference(assume_negation,[status(cth)],[thI34]) ).
fof(c_0_5,plain,
! [X9,X10,X11,X12,X13] :
( ( ~ subset(X9,X10)
| ~ member(X11,X9)
| member(X11,X10) )
& ( member(esk4_2(X12,X13),X12)
| subset(X12,X13) )
& ( ~ member(esk4_2(X12,X13),X13)
| subset(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_6,negated_conjecture,
( subset(esk1_0,esk3_0)
& subset(esk2_0,esk3_0)
& ( ~ subset(esk1_0,esk2_0)
| ~ subset(intersection(esk1_0,difference(esk3_0,esk2_0)),esk2_0) )
& ( subset(esk1_0,esk2_0)
| subset(intersection(esk1_0,difference(esk3_0,esk2_0)),esk2_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[difference]) ).
cnf(c_0_8,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( subset(esk1_0,esk2_0)
| subset(intersection(esk1_0,difference(esk3_0,esk2_0)),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X15,X16,X17] :
( ( member(X15,X16)
| ~ member(X15,intersection(X16,X17)) )
& ( member(X15,X17)
| ~ member(X15,intersection(X16,X17)) )
& ( ~ member(X15,X16)
| ~ member(X15,X17)
| member(X15,intersection(X16,X17)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).
fof(c_0_11,plain,
! [X18,X19,X20] :
( ( member(X18,X20)
| ~ member(X18,difference(X20,X19)) )
& ( ~ member(X18,X19)
| ~ member(X18,difference(X20,X19)) )
& ( ~ member(X18,X20)
| member(X18,X19)
| member(X18,difference(X20,X19)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,negated_conjecture,
( member(X1,esk2_0)
| subset(esk1_0,esk2_0)
| ~ member(X1,intersection(esk1_0,difference(esk3_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
subset(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(X1,difference(esk3_0,esk2_0))
| ~ member(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_8]),c_0_14]) ).
cnf(c_0_17,plain,
( member(X1,X3)
| member(X1,difference(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
( member(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( subset(X1,X2)
| ~ member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,negated_conjecture,
( member(esk4_2(esk1_0,X1),esk2_0)
| subset(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( member(esk4_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ subset(esk1_0,esk2_0)
| ~ subset(intersection(esk1_0,difference(esk3_0,esk2_0)),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,negated_conjecture,
subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( member(esk4_2(intersection(esk1_0,X1),X2),esk2_0)
| subset(intersection(esk1_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
~ subset(intersection(esk1_0,difference(esk3_0,esk2_0)),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
subset(intersection(esk1_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET700+4 : TPTP v8.2.0. Released v2.2.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n016.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon May 20 11:39:07 EDT 2024
% 0.11/0.33 % 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/benchmark/theBenchmark.p
% 0.18/0.49 # Version: 3.1.0
% 0.18/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # new_bool_3 with pid 30505 completed with status 0
% 0.18/0.49 # Result found by new_bool_3
% 0.18/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.49 # SAT001_MinMin_p005000_rr_RG with pid 30510 completed with status 0
% 0.18/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.49 # Preprocessing time : 0.001 s
% 0.18/0.49 # Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Theorem
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 12
% 0.18/0.49 # Removed by relevancy pruning/SinE : 8
% 0.18/0.49 # Initial clauses : 13
% 0.18/0.49 # Removed in clause preprocessing : 0
% 0.18/0.49 # Initial clauses in saturation : 13
% 0.18/0.49 # Processed clauses : 249
% 0.18/0.49 # ...of these trivial : 3
% 0.18/0.49 # ...subsumed : 50
% 0.18/0.49 # ...remaining for further processing : 196
% 0.18/0.49 # Other redundant clauses eliminated : 0
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 2
% 0.18/0.49 # Backward-rewritten : 7
% 0.18/0.49 # Generated clauses : 895
% 0.18/0.49 # ...of the previous two non-redundant : 853
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 12
% 0.18/0.49 # Paramodulations : 895
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 0
% 0.18/0.49 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 44
% 0.18/0.49 # ...of those cached : 9
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 174
% 0.18/0.49 # Positive orientable unit clauses : 80
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 0
% 0.18/0.49 # Non-unit-clauses : 94
% 0.18/0.49 # Current number of unprocessed clauses: 628
% 0.18/0.49 # ...number of literals in the above : 1432
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 22
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 889
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 823
% 0.18/0.49 # Non-unit clause-clause subsumptions : 64
% 0.18/0.49 # Unit Clause-clause subsumption calls : 74
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 124
% 0.18/0.49 # BW rewrite match successes : 5
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 15177
% 0.18/0.49 # Search garbage collected termcells : 280
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.020 s
% 0.18/0.49 # System time : 0.004 s
% 0.18/0.49 # Total time : 0.024 s
% 0.18/0.49 # Maximum resident set size: 1704 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.022 s
% 0.18/0.49 # System time : 0.005 s
% 0.18/0.49 # Total time : 0.027 s
% 0.18/0.49 # Maximum resident set size: 1708 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------