TSTP Solution File: SEU149+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU149+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:57 EDT 2023
% Result : Timeout 0.35s 300.13s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 4 unt; 0 def)
% Number of atoms : 59 ( 41 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 69 ( 25 ~; 29 |; 9 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 39 ( 2 sgn; 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.P8VQwYgTVF/E---3.1_22909.p',d1_tarski) ).
fof(t8_zfmisc_1,conjecture,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.P8VQwYgTVF/E---3.1_22909.p',t8_zfmisc_1) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.P8VQwYgTVF/E---3.1_22909.p',d2_tarski) ).
fof(c_0_3,plain,
! [X19,X20,X21,X22,X23,X24] :
( ( ~ in(X21,X20)
| X21 = X19
| X20 != singleton(X19) )
& ( X22 != X19
| in(X22,X20)
| X20 != singleton(X19) )
& ( ~ in(esk5_2(X23,X24),X24)
| esk5_2(X23,X24) != X23
| X24 = singleton(X23) )
& ( in(esk5_2(X23,X24),X24)
| esk5_2(X23,X24) = X23
| X24 = singleton(X23) ) ),
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])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t8_zfmisc_1]) ).
cnf(c_0_5,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
( singleton(esk1_0) = unordered_pair(esk2_0,esk3_0)
& esk1_0 != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X10,X11,X12,X13,X14,X15,X16,X17] :
( ( ~ in(X13,X12)
| X13 = X10
| X13 = X11
| X12 != unordered_pair(X10,X11) )
& ( X14 != X10
| in(X14,X12)
| X12 != unordered_pair(X10,X11) )
& ( X14 != X11
| in(X14,X12)
| X12 != unordered_pair(X10,X11) )
& ( esk4_3(X15,X16,X17) != X15
| ~ in(esk4_3(X15,X16,X17),X17)
| X17 = unordered_pair(X15,X16) )
& ( esk4_3(X15,X16,X17) != X16
| ~ in(esk4_3(X15,X16,X17),X17)
| X17 = unordered_pair(X15,X16) )
& ( in(esk4_3(X15,X16,X17),X17)
| esk4_3(X15,X16,X17) = X15
| esk4_3(X15,X16,X17) = X16
| X17 = unordered_pair(X15,X16) ) ),
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_tarski])])])])])]) ).
cnf(c_0_8,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
singleton(esk1_0) = unordered_pair(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( X1 = esk1_0
| ~ in(X1,unordered_pair(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU149+3 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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:17:42 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.P8VQwYgTVF/E---3.1_22909.p
% 0.35/300.13 # Version: 3.1pre001
% 0.35/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.35/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.35/300.13 # Starting sh5l with 300s (1) cores
% 0.35/300.13 # new_bool_1 with pid 23097 completed with status 0
% 0.35/300.13 # Result found by new_bool_1
% 0.35/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.35/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.35/300.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.35/300.13 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.35/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.35/300.13 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.35/300.13 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 23103 completed with status 0
% 0.35/300.13 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.35/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.35/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.35/300.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.35/300.13 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.35/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.35/300.13 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.35/300.13 # Preprocessing time : 0.001 s
% 0.35/300.13 # Presaturation interreduction done
% 0.35/300.13
% 0.35/300.13 # Proof found!
% 0.35/300.13 # SZS status Theorem
% 0.35/300.13 # SZS output start CNFRefutation
% See solution above
% 0.35/300.13 # Parsed axioms : 7
% 0.35/300.13 # Removed by relevancy pruning/SinE : 2
% 0.35/300.13 # Initial clauses : 14
% 0.35/300.13 # Removed in clause preprocessing : 0
% 0.35/300.13 # Initial clauses in saturation : 14
% 0.35/300.13 # Processed clauses : 33
% 0.35/300.13 # ...of these trivial : 0
% 0.35/300.13 # ...subsumed : 1
% 0.35/300.13 # ...remaining for further processing : 32
% 0.35/300.13 # Other redundant clauses eliminated : 8
% 0.35/300.13 # Clauses deleted for lack of memory : 0
% 0.35/300.13 # Backward-subsumed : 0
% 0.35/300.13 # Backward-rewritten : 1
% 0.35/300.13 # Generated clauses : 16
% 0.35/300.13 # ...of the previous two non-redundant : 15
% 0.35/300.13 # ...aggressively subsumed : 0
% 0.35/300.13 # Contextual simplify-reflections : 0
% 0.35/300.13 # Paramodulations : 11
% 0.35/300.13 # Factorizations : 0
% 0.35/300.13 # NegExts : 0
% 0.35/300.13 # Equation resolutions : 8
% 0.35/300.13 # Total rewrite steps : 2
% 0.35/300.13 # Propositional unsat checks : 0
% 0.35/300.13 # Propositional check models : 0
% 0.35/300.13 # Propositional check unsatisfiable : 0
% 0.35/300.13 # Propositional clauses : 0
% 0.35/300.13 # Propositional clauses after purity: 0
% 0.35/300.13 # Propositional unsat core size : 0
% 0.35/300.13 # Propositional preprocessing time : 0.000
% 0.35/300.13 # Propositional encoding time : 0.000
% 0.35/300.13 # Propositional solver time : 0.000
% 0.35/300.13 # Success case prop preproc time : 0.000
% 0.35/300.13 # Success case prop encoding time : 0.000
% 0.35/300.13 # Success case prop solver time : 0.000
% 0.35/300.13 # Current number of processed clauses : 12
% 0.35/300.13 # Positive orientable unit clauses : 5
% 0.35/300.13 # Positive unorientable unit clauses: 0
% 0.35/300.13 # Negative unit clauses : 4
% 0.35/300.13 # Non-unit-clauses : 3
% 0.35/300.13 # Current number of unprocessed clauses: 9
% 0.35/300.13 # ...number of literals in the above : 23
% 0.35/300.13 # Current number of archived formulas : 0
% 0.35/300.13 # Current number of archived clauses : 15
% 0.35/300.13 # Clause-clause subsumption calls (NU) : 2
% 0.35/300.13 # Rec. Clause-clause subsumption calls : 2
% 0.35/300.13 # Non-unit clause-clause subsumptions : 0
% 0.35/300.13 # Unit Clause-clause subsumption calls : 4
% 0.35/300.13 # Rewrite failures with RHS unbound : 0
% 0.35/300.13 # BW rewrite match attempts : 11
% 0.35/300.13 # BW rewrite match successes : 3
% 0.35/300.13 # Condensation attempts : 0
% 0.35/300.13 # Condensation successes : 0
% 0.35/300.13 # Termbank termtop insertions : 874
% 0.35/300.13
% 0.35/300.13 # -------------------------------------------------
% 0.35/300.13 # User time : 0.007 s
% 0.35/300.13 # System time : 0.000 s
% 0.35/300.13 # Total time : 0.007 s
% 0.35/300.13 # Maximum resident set size: 1744 pages
% 0.35/300.13
% 0.35/300.13 # -------------------------------------------------
% 0.35/300.13 # User time : 0.008 s
% 0.35/300.13 # System time : 0.003 s
% 0.35/300.13 # Total time : 0.011 s
% 0.35/300.13 # Maximum resident set size: 1676 pages
% 0.35/300.13 % E---3.1 exiting
% 0.35/300.13 % E---3.1 exiting
%------------------------------------------------------------------------------