TSTP Solution File: SEU153+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU153+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:24:58 EDT 2023
% Result : Theorem 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 88 ( 30 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 100 ( 40 ~; 38 |; 14 &)
% ( 7 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 59 ( 2 sgn; 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l25_zfmisc_1,conjecture,
! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.wv87Xieq3R/E---3.1_675.p',l25_zfmisc_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.wv87Xieq3R/E---3.1_675.p',symmetry_r1_xboole_0) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.wv87Xieq3R/E---3.1_675.p',d1_xboole_0) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wv87Xieq3R/E---3.1_675.p',d3_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.wv87Xieq3R/E---3.1_675.p',d7_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.wv87Xieq3R/E---3.1_675.p',d1_tarski) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
inference(assume_negation,[status(cth)],[l25_zfmisc_1]) ).
fof(c_0_7,plain,
! [X20,X21] :
( ~ disjoint(X20,X21)
| disjoint(X21,X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
fof(c_0_8,negated_conjecture,
( disjoint(singleton(esk1_0),esk2_0)
& in(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_10,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( in(X12,X9)
| ~ in(X12,X11)
| X11 != set_intersection2(X9,X10) )
& ( in(X12,X10)
| ~ in(X12,X11)
| X11 != set_intersection2(X9,X10) )
& ( ~ in(X13,X9)
| ~ in(X13,X10)
| in(X13,X11)
| X11 != set_intersection2(X9,X10) )
& ( ~ in(esk3_3(X14,X15,X16),X16)
| ~ in(esk3_3(X14,X15,X16),X14)
| ~ in(esk3_3(X14,X15,X16),X15)
| X16 = set_intersection2(X14,X15) )
& ( in(esk3_3(X14,X15,X16),X14)
| in(esk3_3(X14,X15,X16),X16)
| X16 = set_intersection2(X14,X15) )
& ( in(esk3_3(X14,X15,X16),X15)
| in(esk3_3(X14,X15,X16),X16)
| X16 = set_intersection2(X14,X15) ) ),
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)],[d3_xboole_0])])])])])]) ).
fof(c_0_11,plain,
! [X18,X19] :
( ( ~ disjoint(X18,X19)
| set_intersection2(X18,X19) = empty_set )
& ( set_intersection2(X18,X19) != empty_set
| disjoint(X18,X19) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])]) ).
cnf(c_0_12,plain,
( disjoint(X2,X1)
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
disjoint(singleton(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X32,X33,X34] :
( ( X32 != empty_set
| ~ in(X33,X32) )
& ( in(esk5_1(X34),X34)
| X34 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_15,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
disjoint(esk2_0,singleton(esk1_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X22,X23,X24,X25,X26,X27] :
( ( ~ in(X24,X23)
| X24 = X22
| X23 != singleton(X22) )
& ( X25 != X22
| in(X25,X23)
| X23 != singleton(X22) )
& ( ~ in(esk4_2(X26,X27),X27)
| esk4_2(X26,X27) != X26
| X27 = singleton(X26) )
& ( in(esk4_2(X26,X27),X27)
| esk4_2(X26,X27) = X26
| X27 = singleton(X26) ) ),
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)],[d1_tarski])])])])])]) ).
cnf(c_0_20,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
set_intersection2(esk2_0,singleton(esk1_0)) = empty_set,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ in(X1,singleton(esk1_0))
| ~ in(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU153+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n022.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 : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 08:04:24 EDT 2023
% 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/tmp/tmp.wv87Xieq3R/E---3.1_675.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_1 with pid 762 completed with status 0
% 0.18/0.46 # Result found by new_bool_1
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FGHSS-FFMS31-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 769 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 # Starting new_bool_1 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: FGHSS-FFMS31-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 : 15
% 0.18/0.46 # Removed by relevancy pruning/SinE : 3
% 0.18/0.46 # Initial clauses : 23
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 23
% 0.18/0.46 # Processed clauses : 57
% 0.18/0.46 # ...of these trivial : 0
% 0.18/0.46 # ...subsumed : 1
% 0.18/0.46 # ...remaining for further processing : 56
% 0.18/0.46 # Other redundant clauses eliminated : 7
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 0
% 0.18/0.46 # Backward-rewritten : 1
% 0.18/0.46 # Generated clauses : 41
% 0.18/0.46 # ...of the previous two non-redundant : 30
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 35
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 7
% 0.18/0.46 # Total rewrite steps : 7
% 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 : 26
% 0.18/0.46 # Positive orientable unit clauses : 8
% 0.18/0.46 # Positive unorientable unit clauses: 1
% 0.18/0.46 # Negative unit clauses : 4
% 0.18/0.46 # Non-unit-clauses : 13
% 0.18/0.46 # Current number of unprocessed clauses: 18
% 0.18/0.46 # ...number of literals in the above : 46
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 24
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 75
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 68
% 0.18/0.46 # Non-unit clause-clause subsumptions : 0
% 0.18/0.46 # Unit Clause-clause subsumption calls : 7
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 13
% 0.18/0.46 # BW rewrite match successes : 12
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 1487
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.004 s
% 0.18/0.46 # System time : 0.003 s
% 0.18/0.46 # Total time : 0.006 s
% 0.18/0.46 # Maximum resident set size: 1704 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.004 s
% 0.18/0.46 # System time : 0.006 s
% 0.18/0.46 # Total time : 0.009 s
% 0.18/0.46 # Maximum resident set size: 1680 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------