TSTP Solution File: SEU230+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU230+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:32:04 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 9 unt; 0 def)
% Number of atoms : 58 ( 23 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 66 ( 25 ~; 29 |; 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 : 39 ( 2 sgn 25 !; 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/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(t10_ordinal1,conjecture,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(c_0_4,plain,
! [X8,X9,X10,X11,X12,X13,X14,X15] :
( ( ~ in(X11,X10)
| in(X11,X8)
| in(X11,X9)
| X10 != set_union2(X8,X9) )
& ( ~ in(X12,X8)
| in(X12,X10)
| X10 != set_union2(X8,X9) )
& ( ~ in(X12,X9)
| in(X12,X10)
| X10 != set_union2(X8,X9) )
& ( ~ in(esk2_3(X13,X14,X15),X13)
| ~ in(esk2_3(X13,X14,X15),X15)
| X15 = set_union2(X13,X14) )
& ( ~ in(esk2_3(X13,X14,X15),X14)
| ~ in(esk2_3(X13,X14,X15),X15)
| X15 = set_union2(X13,X14) )
& ( in(esk2_3(X13,X14,X15),X15)
| in(esk2_3(X13,X14,X15),X13)
| in(esk2_3(X13,X14,X15),X14)
| X15 = set_union2(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)],[d2_xboole_0])])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] : in(X1,succ(X1)),
inference(assume_negation,[status(cth)],[t10_ordinal1]) ).
cnf(c_0_6,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X19] : succ(X19) = set_union2(X19,singleton(X19)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_8,plain,
! [X37,X38,X39,X40,X41,X42] :
( ( ~ in(X39,X38)
| X39 = X37
| X38 != singleton(X37) )
& ( X40 != X37
| in(X40,X38)
| X38 != singleton(X37) )
& ( ~ in(esk7_2(X41,X42),X42)
| esk7_2(X41,X42) != X41
| X42 = singleton(X41) )
& ( in(esk7_2(X41,X42),X42)
| esk7_2(X41,X42) = X41
| X42 = singleton(X41) ) ),
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)],[d1_tarski])])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ in(esk1_0,succ(esk1_0)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_10,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
succ(X1) = set_union2(X1,singleton(X1)),
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,succ(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(X1,succ(X2))
| ~ in(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_10,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.11/0.12 % Problem : SEU230+1 : TPTP v8.2.0. Released v3.3.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 15:23:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 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/benchmark/theBenchmark.p
% 0.21/0.49 # Version: 3.1.0
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # new_bool_3 with pid 10993 completed with status 0
% 0.21/0.49 # Result found by new_bool_3
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHSS-FFMS31-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # SAT001_MinMin_p005000_rr_RG with pid 10997 completed with status 0
% 0.21/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHSS-FFMS31-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 38
% 0.21/0.49 # Removed by relevancy pruning/SinE : 20
% 0.21/0.49 # Initial clauses : 28
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 28
% 0.21/0.49 # Processed clauses : 128
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 30
% 0.21/0.49 # ...remaining for further processing : 98
% 0.21/0.49 # Other redundant clauses eliminated : 6
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 2
% 0.21/0.49 # Generated clauses : 223
% 0.21/0.49 # ...of the previous two non-redundant : 181
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 212
% 0.21/0.49 # Factorizations : 6
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 6
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 8
% 0.21/0.49 # ...of those cached : 2
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 63
% 0.21/0.49 # Positive orientable unit clauses : 7
% 0.21/0.49 # Positive unorientable unit clauses: 1
% 0.21/0.49 # Negative unit clauses : 28
% 0.21/0.49 # Non-unit-clauses : 27
% 0.21/0.49 # Current number of unprocessed clauses: 106
% 0.21/0.49 # ...number of literals in the above : 220
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 30
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 212
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 182
% 0.21/0.49 # Non-unit clause-clause subsumptions : 14
% 0.21/0.49 # Unit Clause-clause subsumption calls : 67
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 17
% 0.21/0.49 # BW rewrite match successes : 17
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 4026
% 0.21/0.49 # Search garbage collected termcells : 457
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.005 s
% 0.21/0.49 # System time : 0.003 s
% 0.21/0.49 # Total time : 0.008 s
% 0.21/0.49 # Maximum resident set size: 1868 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.007 s
% 0.21/0.49 # System time : 0.005 s
% 0.21/0.49 # Total time : 0.012 s
% 0.21/0.49 # Maximum resident set size: 1716 pages
% 0.21/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------