TSTP Solution File: SEU126+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU126+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:49 EDT 2023
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 13 unt; 0 def)
% Number of atoms : 109 ( 26 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 109 ( 41 ~; 50 |; 11 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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; 2 con; 0-3 aty)
% Number of variables : 88 ( 8 sgn; 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t12_xboole_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.jQk5R4mto7/E---3.1_23672.p',t12_xboole_1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jQk5R4mto7/E---3.1_23672.p',d2_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.jQk5R4mto7/E---3.1_23672.p',d3_tarski) ).
fof(idempotence_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.jQk5R4mto7/E---3.1_23672.p',idempotence_k2_xboole_0) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.jQk5R4mto7/E---3.1_23672.p',commutativity_k2_xboole_0) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.jQk5R4mto7/E---3.1_23672.p',d10_xboole_0) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
inference(assume_negation,[status(cth)],[t12_xboole_1]) ).
fof(c_0_7,plain,
! [X29,X30,X31,X32,X33,X34,X35,X36] :
( ( ~ in(X32,X31)
| in(X32,X29)
| in(X32,X30)
| X31 != set_union2(X29,X30) )
& ( ~ in(X33,X29)
| in(X33,X31)
| X31 != set_union2(X29,X30) )
& ( ~ in(X33,X30)
| in(X33,X31)
| X31 != set_union2(X29,X30) )
& ( ~ in(esk6_3(X34,X35,X36),X34)
| ~ in(esk6_3(X34,X35,X36),X36)
| X36 = set_union2(X34,X35) )
& ( ~ in(esk6_3(X34,X35,X36),X35)
| ~ in(esk6_3(X34,X35,X36),X36)
| X36 = set_union2(X34,X35) )
& ( in(esk6_3(X34,X35,X36),X36)
| in(esk6_3(X34,X35,X36),X34)
| in(esk6_3(X34,X35,X36),X35)
| X36 = set_union2(X34,X35) ) ),
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)],[d2_xboole_0])])])])])]) ).
fof(c_0_8,plain,
! [X16,X17,X18,X19,X20] :
( ( ~ subset(X16,X17)
| ~ in(X18,X16)
| in(X18,X17) )
& ( in(esk3_2(X19,X20),X19)
| subset(X19,X20) )
& ( ~ in(esk3_2(X19,X20),X20)
| subset(X19,X20) ) ),
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_tarski])])])])])]) ).
fof(c_0_9,negated_conjecture,
( subset(esk1_0,esk2_0)
& set_union2(esk1_0,esk2_0) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_10,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( subset(X1,set_union2(X2,X3))
| ~ in(esk3_2(X1,set_union2(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( subset(esk1_0,X1)
| in(esk3_2(esk1_0,X1),esk2_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
subset(esk1_0,set_union2(X1,esk2_0)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( in(X1,set_union2(X2,esk2_0))
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
fof(c_0_21,plain,
! [X13] : set_union2(X13,X13) = X13,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k2_xboole_0])]) ).
cnf(c_0_22,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X2 != set_union2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( subset(X1,set_union2(X2,esk2_0))
| ~ in(esk3_2(X1,set_union2(X2,esk2_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_24,plain,
set_union2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
( subset(X1,esk2_0)
| ~ in(esk3_2(X1,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( subset(set_union2(X1,X2),X3)
| in(esk3_2(set_union2(X1,X2),X3),X2)
| in(esk3_2(set_union2(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_29,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_26]) ).
fof(c_0_30,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_31,plain,
! [X14,X15] :
( ( subset(X14,X15)
| X14 != X15 )
& ( subset(X15,X14)
| X14 != X15 )
& ( ~ subset(X14,X15)
| ~ subset(X15,X14)
| X14 = X15 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
cnf(c_0_32,negated_conjecture,
( subset(set_union2(X1,esk1_0),esk2_0)
| in(esk3_2(set_union2(X1,esk1_0),esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( subset(X1,set_union2(X2,X3))
| ~ in(esk3_2(X1,set_union2(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
set_union2(esk1_0,esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
subset(set_union2(esk2_0,esk1_0),esk2_0),
inference(spm,[status(thm)],[c_0_13,c_0_32]) ).
cnf(c_0_38,plain,
subset(X1,set_union2(X1,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_39,negated_conjecture,
set_union2(esk2_0,esk1_0) != esk2_0,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU126+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 09:20:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.jQk5R4mto7/E---3.1_23672.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # new_bool_3 with pid 23783 completed with status 0
% 0.22/0.53 # Result found by new_bool_3
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSS-FFSF32-SFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.53 # SAT001_MinMin_p005000_rr_RG with pid 23793 completed with status 0
% 0.22/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSS-FFSF32-SFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 19
% 0.22/0.53 # Removed by relevancy pruning/SinE : 5
% 0.22/0.53 # Initial clauses : 24
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 24
% 0.22/0.53 # Processed clauses : 398
% 0.22/0.53 # ...of these trivial : 3
% 0.22/0.53 # ...subsumed : 241
% 0.22/0.53 # ...remaining for further processing : 154
% 0.22/0.53 # Other redundant clauses eliminated : 5
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 2
% 0.22/0.53 # Backward-rewritten : 1
% 0.22/0.53 # Generated clauses : 777
% 0.22/0.53 # ...of the previous two non-redundant : 726
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 722
% 0.22/0.53 # Factorizations : 50
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 5
% 0.22/0.53 # Total rewrite steps : 69
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 124
% 0.22/0.53 # Positive orientable unit clauses : 9
% 0.22/0.53 # Positive unorientable unit clauses: 1
% 0.22/0.53 # Negative unit clauses : 3
% 0.22/0.53 # Non-unit-clauses : 111
% 0.22/0.53 # Current number of unprocessed clauses: 371
% 0.22/0.53 # ...number of literals in the above : 1156
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 25
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 4622
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 4374
% 0.22/0.53 # Non-unit clause-clause subsumptions : 238
% 0.22/0.53 # Unit Clause-clause subsumption calls : 13
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 27
% 0.22/0.53 # BW rewrite match successes : 16
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 10393
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.027 s
% 0.22/0.53 # System time : 0.001 s
% 0.22/0.53 # Total time : 0.028 s
% 0.22/0.53 # Maximum resident set size: 1744 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.027 s
% 0.22/0.53 # System time : 0.004 s
% 0.22/0.53 # Total time : 0.031 s
% 0.22/0.53 # Maximum resident set size: 1688 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------