TSTP Solution File: SEU129+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU129+2 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 03:31:23 EDT 2024
% Result : Theorem 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 14 unt; 0 def)
% Number of atoms : 61 ( 3 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 50 ( 20 ~; 19 |; 5 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 59 ( 3 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t26_xboole_1,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(t17_xboole_1,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(t19_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
inference(assume_negation,[status(cth)],[t26_xboole_1]) ).
fof(c_0_7,lemma,
! [X24,X25,X26] :
( ~ subset(X24,X25)
| ~ subset(X25,X26)
| subset(X24,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_8,negated_conjecture,
( subset(esk1_0,esk2_0)
& ~ subset(set_intersection2(esk1_0,esk3_0),set_intersection2(esk2_0,esk3_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_9,lemma,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,lemma,
! [X19,X20] : subset(set_intersection2(X19,X20),X19),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_12,plain,
! [X10,X11,X12,X13,X14] :
( ( ~ subset(X10,X11)
| ~ in(X12,X10)
| in(X12,X11) )
& ( in(esk4_2(X13,X14),X13)
| subset(X13,X14) )
& ( ~ in(esk4_2(X13,X14),X14)
| subset(X13,X14) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_13,lemma,
! [X21,X22,X23] :
( ~ subset(X21,X22)
| ~ subset(X21,X23)
| subset(X21,set_intersection2(X22,X23)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])])]) ).
cnf(c_0_14,negated_conjecture,
( subset(X1,esk2_0)
| ~ subset(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,lemma,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X34,X35] : set_intersection2(X34,X35) = set_intersection2(X35,X34),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_17,negated_conjecture,
~ subset(set_intersection2(esk1_0,esk3_0),set_intersection2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( in(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,lemma,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,lemma,
subset(set_intersection2(esk1_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
in(esk4_2(set_intersection2(esk1_0,esk3_0),set_intersection2(esk2_0,esk3_0)),set_intersection2(esk1_0,esk3_0)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,lemma,
( subset(set_intersection2(esk1_0,X1),set_intersection2(X2,esk2_0))
| ~ subset(set_intersection2(esk1_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,lemma,
subset(set_intersection2(X1,X2),X2),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( in(esk4_2(set_intersection2(esk1_0,esk3_0),set_intersection2(esk2_0,esk3_0)),X1)
| ~ subset(set_intersection2(esk1_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,lemma,
subset(set_intersection2(esk1_0,X1),set_intersection2(X1,esk2_0)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,negated_conjecture,
in(esk4_2(set_intersection2(esk1_0,esk3_0),set_intersection2(esk2_0,esk3_0)),set_intersection2(esk2_0,esk3_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_21]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU129+2 : TPTP v8.2.0. Released v3.3.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 17:06:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.47 # Version: 3.1.0
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # Starting sh5l with 300s (1) cores
% 0.15/0.47 # new_bool_1 with pid 3104 completed with status 0
% 0.15/0.47 # Result found by new_bool_1
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.15/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.15/0.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 3107 completed with status 0
% 0.15/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.15/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.15/0.47 # Preprocessing time : 0.001 s
% 0.15/0.47 # Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 # Proof found!
% 0.15/0.47 # SZS status Theorem
% 0.15/0.47 # SZS output start CNFRefutation
% See solution above
% 0.15/0.47 # Parsed axioms : 37
% 0.15/0.47 # Removed by relevancy pruning/SinE : 7
% 0.15/0.47 # Initial clauses : 46
% 0.15/0.47 # Removed in clause preprocessing : 0
% 0.15/0.47 # Initial clauses in saturation : 46
% 0.15/0.47 # Processed clauses : 518
% 0.15/0.47 # ...of these trivial : 40
% 0.15/0.47 # ...subsumed : 223
% 0.15/0.47 # ...remaining for further processing : 255
% 0.15/0.47 # Other redundant clauses eliminated : 9
% 0.15/0.47 # Clauses deleted for lack of memory : 0
% 0.15/0.47 # Backward-subsumed : 2
% 0.15/0.47 # Backward-rewritten : 3
% 0.15/0.47 # Generated clauses : 1584
% 0.15/0.47 # ...of the previous two non-redundant : 1208
% 0.15/0.47 # ...aggressively subsumed : 0
% 0.15/0.47 # Contextual simplify-reflections : 0
% 0.15/0.47 # Paramodulations : 1565
% 0.15/0.47 # Factorizations : 10
% 0.15/0.47 # NegExts : 0
% 0.15/0.47 # Equation resolutions : 9
% 0.15/0.47 # Disequality decompositions : 0
% 0.15/0.47 # Total rewrite steps : 623
% 0.15/0.47 # ...of those cached : 505
% 0.15/0.47 # Propositional unsat checks : 0
% 0.15/0.47 # Propositional check models : 0
% 0.15/0.47 # Propositional check unsatisfiable : 0
% 0.15/0.47 # Propositional clauses : 0
% 0.15/0.47 # Propositional clauses after purity: 0
% 0.15/0.47 # Propositional unsat core size : 0
% 0.15/0.47 # Propositional preprocessing time : 0.000
% 0.15/0.47 # Propositional encoding time : 0.000
% 0.15/0.47 # Propositional solver time : 0.000
% 0.15/0.47 # Success case prop preproc time : 0.000
% 0.15/0.47 # Success case prop encoding time : 0.000
% 0.15/0.47 # Success case prop solver time : 0.000
% 0.15/0.47 # Current number of processed clauses : 197
% 0.15/0.47 # Positive orientable unit clauses : 52
% 0.15/0.47 # Positive unorientable unit clauses: 2
% 0.15/0.47 # Negative unit clauses : 15
% 0.15/0.47 # Non-unit-clauses : 128
% 0.15/0.47 # Current number of unprocessed clauses: 769
% 0.15/0.47 # ...number of literals in the above : 1577
% 0.15/0.47 # Current number of archived formulas : 0
% 0.15/0.47 # Current number of archived clauses : 49
% 0.15/0.47 # Clause-clause subsumption calls (NU) : 2067
% 0.15/0.47 # Rec. Clause-clause subsumption calls : 1789
% 0.15/0.47 # Non-unit clause-clause subsumptions : 183
% 0.15/0.47 # Unit Clause-clause subsumption calls : 70
% 0.15/0.47 # Rewrite failures with RHS unbound : 0
% 0.15/0.47 # BW rewrite match attempts : 109
% 0.15/0.47 # BW rewrite match successes : 43
% 0.15/0.47 # Condensation attempts : 0
% 0.15/0.47 # Condensation successes : 0
% 0.15/0.47 # Termbank termtop insertions : 19328
% 0.15/0.47 # Search garbage collected termcells : 689
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.029 s
% 0.15/0.47 # System time : 0.001 s
% 0.15/0.47 # Total time : 0.030 s
% 0.15/0.47 # Maximum resident set size: 1896 pages
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.031 s
% 0.15/0.47 # System time : 0.002 s
% 0.15/0.47 # Total time : 0.033 s
% 0.15/0.47 # Maximum resident set size: 1720 pages
% 0.15/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------