TSTP Solution File: SEU230+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU230+1 : 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:25:23 EDT 2023
% Result : Timeout 0.23s 300.15s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 57 ( 23 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 65 ( 25 ~; 28 |; 8 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-3 aty)
% Number of variables : 37 ( 2 sgn; 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t10_ordinal1,conjecture,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox2/tmp/tmp.0e0VUsuYzP/E---3.1_8619.p',t10_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox2/tmp/tmp.0e0VUsuYzP/E---3.1_8619.p',d1_ordinal1) ).
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.0e0VUsuYzP/E---3.1_8619.p',d2_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.0e0VUsuYzP/E---3.1_8619.p',d1_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] : in(X1,succ(X1)),
inference(assume_negation,[status(cth)],[t10_ordinal1]) ).
fof(c_0_5,negated_conjecture,
~ in(esk1_0,succ(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X30] : succ(X30) = set_union2(X30,singleton(X30)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_7,plain,
! [X15,X16,X17,X18,X19,X20,X21,X22] :
( ( ~ in(X18,X17)
| in(X18,X15)
| in(X18,X16)
| X17 != set_union2(X15,X16) )
& ( ~ in(X19,X15)
| in(X19,X17)
| X17 != set_union2(X15,X16) )
& ( ~ in(X19,X16)
| in(X19,X17)
| X17 != set_union2(X15,X16) )
& ( ~ in(esk3_3(X20,X21,X22),X20)
| ~ in(esk3_3(X20,X21,X22),X22)
| X22 = set_union2(X20,X21) )
& ( ~ in(esk3_3(X20,X21,X22),X21)
| ~ in(esk3_3(X20,X21,X22),X22)
| X22 = set_union2(X20,X21) )
& ( in(esk3_3(X20,X21,X22),X22)
| in(esk3_3(X20,X21,X22),X20)
| in(esk3_3(X20,X21,X22),X21)
| X22 = set_union2(X20,X21) ) ),
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,
! [X8,X9,X10,X11,X12,X13] :
( ( ~ in(X10,X9)
| X10 = X8
| X9 != singleton(X8) )
& ( X11 != X8
| in(X11,X9)
| X9 != singleton(X8) )
& ( ~ in(esk2_2(X12,X13),X13)
| esk2_2(X12,X13) != X12
| X13 = singleton(X12) )
& ( in(esk2_2(X12,X13),X13)
| esk2_2(X12,X13) = X12
| X13 = singleton(X12) ) ),
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_9,negated_conjecture,
~ in(esk1_0,succ(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ in(esk1_0,set_union2(esk1_0,singleton(esk1_0))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : SEU230+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.09 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 2400
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Mon Oct 2 08:15:19 EDT 2023
% 0.09/0.28 % CPUTime :
% 0.13/0.38 Running first-order theorem proving
% 0.13/0.38 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.0e0VUsuYzP/E---3.1_8619.p
% 0.23/300.15 # Version: 3.1pre001
% 0.23/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.23/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.23/300.15 # Starting sh5l with 300s (1) cores
% 0.23/300.15 # sh5l with pid 8811 completed with status 0
% 0.23/300.15 # Result found by sh5l
% 0.23/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.23/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.23/300.15 # Starting sh5l with 300s (1) cores
% 0.23/300.15 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/300.15 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.23/300.15 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.23/300.15 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.23/300.15 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 8817 completed with status 0
% 0.23/300.15 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.23/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.23/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.23/300.15 # Starting sh5l with 300s (1) cores
% 0.23/300.15 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/300.15 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.23/300.15 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.23/300.15 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.23/300.15 # Preprocessing time : 0.001 s
% 0.23/300.15 # Presaturation interreduction done
% 0.23/300.15
% 0.23/300.15 # Proof found!
% 0.23/300.15 # SZS status Theorem
% 0.23/300.15 # SZS output start CNFRefutation
% See solution above
% 0.23/300.15 # Parsed axioms : 38
% 0.23/300.15 # Removed by relevancy pruning/SinE : 5
% 0.23/300.15 # Initial clauses : 56
% 0.23/300.15 # Removed in clause preprocessing : 2
% 0.23/300.15 # Initial clauses in saturation : 54
% 0.23/300.15 # Processed clauses : 111
% 0.23/300.15 # ...of these trivial : 3
% 0.23/300.15 # ...subsumed : 0
% 0.23/300.15 # ...remaining for further processing : 108
% 0.23/300.15 # Other redundant clauses eliminated : 6
% 0.23/300.15 # Clauses deleted for lack of memory : 0
% 0.23/300.15 # Backward-subsumed : 0
% 0.23/300.15 # Backward-rewritten : 8
% 0.23/300.15 # Generated clauses : 36
% 0.23/300.15 # ...of the previous two non-redundant : 26
% 0.23/300.15 # ...aggressively subsumed : 0
% 0.23/300.15 # Contextual simplify-reflections : 2
% 0.23/300.15 # Paramodulations : 31
% 0.23/300.15 # Factorizations : 0
% 0.23/300.15 # NegExts : 0
% 0.23/300.15 # Equation resolutions : 6
% 0.23/300.15 # Total rewrite steps : 18
% 0.23/300.15 # Propositional unsat checks : 0
% 0.23/300.15 # Propositional check models : 0
% 0.23/300.15 # Propositional check unsatisfiable : 0
% 0.23/300.15 # Propositional clauses : 0
% 0.23/300.15 # Propositional clauses after purity: 0
% 0.23/300.15 # Propositional unsat core size : 0
% 0.23/300.15 # Propositional preprocessing time : 0.000
% 0.23/300.15 # Propositional encoding time : 0.000
% 0.23/300.15 # Propositional solver time : 0.000
% 0.23/300.15 # Success case prop preproc time : 0.000
% 0.23/300.15 # Success case prop encoding time : 0.000
% 0.23/300.15 # Success case prop solver time : 0.000
% 0.23/300.15 # Current number of processed clauses : 44
% 0.23/300.15 # Positive orientable unit clauses : 23
% 0.23/300.15 # Positive unorientable unit clauses: 1
% 0.23/300.15 # Negative unit clauses : 6
% 0.23/300.15 # Non-unit-clauses : 14
% 0.23/300.15 # Current number of unprocessed clauses: 18
% 0.23/300.15 # ...number of literals in the above : 43
% 0.23/300.15 # Current number of archived formulas : 0
% 0.23/300.15 # Current number of archived clauses : 59
% 0.23/300.15 # Clause-clause subsumption calls (NU) : 105
% 0.23/300.15 # Rec. Clause-clause subsumption calls : 85
% 0.23/300.15 # Non-unit clause-clause subsumptions : 2
% 0.23/300.15 # Unit Clause-clause subsumption calls : 24
% 0.23/300.15 # Rewrite failures with RHS unbound : 0
% 0.23/300.15 # BW rewrite match attempts : 31
% 0.23/300.15 # BW rewrite match successes : 26
% 0.23/300.15 # Condensation attempts : 0
% 0.23/300.15 # Condensation successes : 0
% 0.23/300.15 # Termbank termtop insertions : 2418
% 0.23/300.15
% 0.23/300.15 # -------------------------------------------------
% 0.23/300.15 # User time : 0.004 s
% 0.23/300.15 # System time : 0.003 s
% 0.23/300.15 # Total time : 0.007 s
% 0.23/300.15 # Maximum resident set size: 1852 pages
% 0.23/300.15
% 0.23/300.15 # -------------------------------------------------
% 0.23/300.15 # User time : 0.005 s
% 0.23/300.15 # System time : 0.004 s
% 0.23/300.15 # Total time : 0.009 s
% 0.23/300.15 # Maximum resident set size: 1704 pages
% 0.23/300.15 % E---3.1 exiting
% 0.23/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------