TSTP Solution File: SEU124+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU124+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:30:26 EDT 2023
% Result : Timeout 0.29s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 55 ( 11 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 57 ( 21 ~; 25 |; 7 &)
% ( 3 <=>; 1 =>; 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 : 48 ( 4 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/tmp.xUD5ekB3Q6/E---3.1_32117.p',d2_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xUD5ekB3Q6/E---3.1_32117.p',d3_tarski) ).
fof(t7_xboole_1,conjecture,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.xUD5ekB3Q6/E---3.1_32117.p',t7_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.xUD5ekB3Q6/E---3.1_32117.p',commutativity_k2_xboole_0) ).
fof(c_0_4,plain,
! [X23,X24,X25,X26,X27,X28,X29,X30] :
( ( ~ in(X26,X25)
| in(X26,X23)
| in(X26,X24)
| X25 != set_union2(X23,X24) )
& ( ~ in(X27,X23)
| in(X27,X25)
| X25 != set_union2(X23,X24) )
& ( ~ in(X27,X24)
| in(X27,X25)
| X25 != set_union2(X23,X24) )
& ( ~ in(esk4_3(X28,X29,X30),X28)
| ~ in(esk4_3(X28,X29,X30),X30)
| X30 = set_union2(X28,X29) )
& ( ~ in(esk4_3(X28,X29,X30),X29)
| ~ in(esk4_3(X28,X29,X30),X30)
| X30 = set_union2(X28,X29) )
& ( in(esk4_3(X28,X29,X30),X30)
| in(esk4_3(X28,X29,X30),X28)
| in(esk4_3(X28,X29,X30),X29)
| X30 = set_union2(X28,X29) ) ),
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_5,plain,
! [X9,X10,X11,X12,X13] :
( ( ~ subset(X9,X10)
| ~ in(X11,X9)
| in(X11,X10) )
& ( in(esk3_2(X12,X13),X12)
| subset(X12,X13) )
& ( ~ in(esk3_2(X12,X13),X13)
| subset(X12,X13) ) ),
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])])])])])]) ).
cnf(c_0_6,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] : subset(X1,set_union2(X1,X2)),
inference(assume_negation,[status(cth)],[t7_xboole_1]) ).
cnf(c_0_10,plain,
( subset(X1,set_union2(X2,X3))
| ~ in(esk3_2(X1,set_union2(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_12,plain,
! [X21,X22] : set_union2(X21,X22) = set_union2(X22,X21),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_13,negated_conjecture,
~ subset(esk1_0,set_union2(esk1_0,esk2_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_14,plain,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ subset(esk1_0,set_union2(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
subset(X1,set_union2(X1,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09 % Problem : SEU124+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 09:27:04 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.xUD5ekB3Q6/E---3.1_32117.p
% 0.29/300.10 # Version: 3.1pre001
% 0.29/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.29/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.29/300.10 # Starting sh5l with 300s (1) cores
% 0.29/300.10 # new_bool_3 with pid 32199 completed with status 0
% 0.29/300.10 # Result found by new_bool_3
% 0.29/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.29/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/300.10 # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.29/300.10 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.29/300.10 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 163s (1) cores
% 0.29/300.10 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 32202 completed with status 0
% 0.29/300.10 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 0.29/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.29/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/300.10 # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.29/300.10 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.29/300.10 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 163s (1) cores
% 0.29/300.10 # Preprocessing time : 0.001 s
% 0.29/300.10
% 0.29/300.10 # Proof found!
% 0.29/300.10 # SZS status Theorem
% 0.29/300.10 # SZS output start CNFRefutation
% See solution above
% 0.29/300.10 # Parsed axioms : 31
% 0.29/300.10 # Removed by relevancy pruning/SinE : 10
% 0.29/300.10 # Initial clauses : 31
% 0.29/300.10 # Removed in clause preprocessing : 0
% 0.29/300.10 # Initial clauses in saturation : 31
% 0.29/300.10 # Processed clauses : 139
% 0.29/300.10 # ...of these trivial : 1
% 0.29/300.10 # ...subsumed : 73
% 0.29/300.10 # ...remaining for further processing : 65
% 0.29/300.10 # Other redundant clauses eliminated : 6
% 0.29/300.10 # Clauses deleted for lack of memory : 0
% 0.29/300.10 # Backward-subsumed : 0
% 0.29/300.10 # Backward-rewritten : 2
% 0.29/300.10 # Generated clauses : 249
% 0.29/300.10 # ...of the previous two non-redundant : 196
% 0.29/300.10 # ...aggressively subsumed : 0
% 0.29/300.10 # Contextual simplify-reflections : 0
% 0.29/300.10 # Paramodulations : 231
% 0.29/300.10 # Factorizations : 12
% 0.29/300.10 # NegExts : 0
% 0.29/300.10 # Equation resolutions : 6
% 0.29/300.10 # Total rewrite steps : 40
% 0.29/300.10 # Propositional unsat checks : 0
% 0.29/300.10 # Propositional check models : 0
% 0.29/300.10 # Propositional check unsatisfiable : 0
% 0.29/300.10 # Propositional clauses : 0
% 0.29/300.10 # Propositional clauses after purity: 0
% 0.29/300.10 # Propositional unsat core size : 0
% 0.29/300.10 # Propositional preprocessing time : 0.000
% 0.29/300.10 # Propositional encoding time : 0.000
% 0.29/300.10 # Propositional solver time : 0.000
% 0.29/300.10 # Success case prop preproc time : 0.000
% 0.29/300.10 # Success case prop encoding time : 0.000
% 0.29/300.10 # Success case prop solver time : 0.000
% 0.29/300.10 # Current number of processed clauses : 57
% 0.29/300.10 # Positive orientable unit clauses : 9
% 0.29/300.10 # Positive unorientable unit clauses: 1
% 0.29/300.10 # Negative unit clauses : 3
% 0.29/300.10 # Non-unit-clauses : 44
% 0.29/300.10 # Current number of unprocessed clauses: 88
% 0.29/300.10 # ...number of literals in the above : 260
% 0.29/300.10 # Current number of archived formulas : 0
% 0.29/300.10 # Current number of archived clauses : 2
% 0.29/300.10 # Clause-clause subsumption calls (NU) : 281
% 0.29/300.10 # Rec. Clause-clause subsumption calls : 253
% 0.29/300.10 # Non-unit clause-clause subsumptions : 62
% 0.29/300.10 # Unit Clause-clause subsumption calls : 5
% 0.29/300.10 # Rewrite failures with RHS unbound : 0
% 0.29/300.10 # BW rewrite match attempts : 16
% 0.29/300.10 # BW rewrite match successes : 8
% 0.29/300.10 # Condensation attempts : 0
% 0.29/300.10 # Condensation successes : 0
% 0.29/300.10 # Termbank termtop insertions : 3628
% 0.29/300.10
% 0.29/300.10 # -------------------------------------------------
% 0.29/300.10 # User time : 0.005 s
% 0.29/300.10 # System time : 0.002 s
% 0.29/300.10 # Total time : 0.007 s
% 0.29/300.10 # Maximum resident set size: 1708 pages
% 0.29/300.10
% 0.29/300.10 # -------------------------------------------------
% 0.29/300.10 # User time : 0.006 s
% 0.29/300.10 # System time : 0.003 s
% 0.29/300.10 # Total time : 0.009 s
% 0.29/300.10 # Maximum resident set size: 1704 pages
% 0.29/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------