TSTP Solution File: SEU267+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU267+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:31:14 EDT 2023
% Result : Timeout 0.65s 300.15s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 52 ( 51 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 62 ( 26 ~; 24 |; 6 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 54 ( 10 sgn; 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_mcart_1,axiom,
! [X1] :
( ? [X2,X3] : X1 = ordered_pair(X2,X3)
=> ! [X2] :
( X2 = pair_second(X1)
<=> ! [X3,X4] :
( X1 = ordered_pair(X3,X4)
=> X2 = X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kQzLoLGdSO/E---3.1_445.p',d2_mcart_1) ).
fof(t7_mcart_1,conjecture,
! [X1,X2] :
( pair_first(ordered_pair(X1,X2)) = X1
& pair_second(ordered_pair(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.kQzLoLGdSO/E---3.1_445.p',t7_mcart_1) ).
fof(d1_mcart_1,axiom,
! [X1] :
( ? [X2,X3] : X1 = ordered_pair(X2,X3)
=> ! [X2] :
( X2 = pair_first(X1)
<=> ! [X3,X4] :
( X1 = ordered_pair(X3,X4)
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kQzLoLGdSO/E---3.1_445.p',d1_mcart_1) ).
fof(c_0_3,plain,
! [X9,X10,X11,X12,X13,X14,X15] :
( ( X12 != pair_second(X9)
| X9 != ordered_pair(X13,X14)
| X12 = X14
| X9 != ordered_pair(X10,X11) )
& ( X9 = ordered_pair(esk3_2(X9,X15),esk4_2(X9,X15))
| X15 = pair_second(X9)
| X9 != ordered_pair(X10,X11) )
& ( X15 != esk4_2(X9,X15)
| X15 = pair_second(X9)
| X9 != ordered_pair(X10,X11) ) ),
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_mcart_1])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( pair_first(ordered_pair(X1,X2)) = X1
& pair_second(ordered_pair(X1,X2)) = X2 ),
inference(assume_negation,[status(cth)],[t7_mcart_1]) ).
cnf(c_0_5,plain,
( X1 = X4
| X1 != pair_second(X2)
| X2 != ordered_pair(X3,X4)
| X2 != ordered_pair(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X72,X73,X74,X75,X76,X77,X78] :
( ( X75 != pair_first(X72)
| X72 != ordered_pair(X76,X77)
| X75 = X76
| X72 != ordered_pair(X73,X74) )
& ( X72 = ordered_pair(esk20_2(X72,X78),esk21_2(X72,X78))
| X78 = pair_first(X72)
| X72 != ordered_pair(X73,X74) )
& ( X78 != esk20_2(X72,X78)
| X78 = pair_first(X72)
| X72 != ordered_pair(X73,X74) ) ),
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_mcart_1])])])])])]) ).
fof(c_0_7,negated_conjecture,
( pair_first(ordered_pair(esk1_0,esk2_0)) != esk1_0
| pair_second(ordered_pair(esk1_0,esk2_0)) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,plain,
( pair_second(ordered_pair(X1,X2)) = X3
| ordered_pair(X1,X2) != ordered_pair(X4,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_5])]) ).
cnf(c_0_9,plain,
( X1 = X3
| X1 != pair_first(X2)
| X2 != ordered_pair(X3,X4)
| X2 != ordered_pair(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( pair_first(ordered_pair(esk1_0,esk2_0)) != esk1_0
| pair_second(ordered_pair(esk1_0,esk2_0)) != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
pair_second(ordered_pair(X1,X2)) = X2,
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( pair_first(ordered_pair(X1,X2)) = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,negated_conjecture,
pair_first(ordered_pair(esk1_0,esk2_0)) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_14,plain,
pair_first(ordered_pair(X1,X2)) = X1,
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU267+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:10:53 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.45 Running first-order model finding
% 0.16/0.45 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.kQzLoLGdSO/E---3.1_445.p
% 0.65/300.15 # Version: 3.1pre001
% 0.65/300.15 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.65/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/300.15 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.65/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.65/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.65/300.15 # Starting sh5l with 300s (1) cores
% 0.65/300.15 # new_bool_3 with pid 540 completed with status 0
% 0.65/300.15 # Result found by new_bool_3
% 0.65/300.15 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.65/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/300.15 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.65/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.65/300.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.65/300.15 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.65/300.15 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.65/300.15 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.65/300.15 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 543 completed with status 0
% 0.65/300.15 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.65/300.15 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.65/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/300.15 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.65/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.65/300.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.65/300.15 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.65/300.15 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.65/300.15 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.65/300.15 # Preprocessing time : 0.004 s
% 0.65/300.15 # Presaturation interreduction done
% 0.65/300.15
% 0.65/300.15 # Proof found!
% 0.65/300.15 # SZS status Theorem
% 0.65/300.15 # SZS output start CNFRefutation
% See solution above
% 0.65/300.15 # Parsed axioms : 342
% 0.65/300.15 # Removed by relevancy pruning/SinE : 285
% 0.65/300.15 # Initial clauses : 105
% 0.65/300.15 # Removed in clause preprocessing : 2
% 0.65/300.15 # Initial clauses in saturation : 103
% 0.65/300.15 # Processed clauses : 326
% 0.65/300.15 # ...of these trivial : 4
% 0.65/300.15 # ...subsumed : 60
% 0.65/300.15 # ...remaining for further processing : 262
% 0.65/300.15 # Other redundant clauses eliminated : 17
% 0.65/300.15 # Clauses deleted for lack of memory : 0
% 0.65/300.15 # Backward-subsumed : 0
% 0.65/300.15 # Backward-rewritten : 20
% 0.65/300.15 # Generated clauses : 329
% 0.65/300.15 # ...of the previous two non-redundant : 262
% 0.65/300.15 # ...aggressively subsumed : 0
% 0.65/300.15 # Contextual simplify-reflections : 0
% 0.65/300.15 # Paramodulations : 310
% 0.65/300.15 # Factorizations : 0
% 0.65/300.15 # NegExts : 0
% 0.65/300.15 # Equation resolutions : 21
% 0.65/300.15 # Total rewrite steps : 143
% 0.65/300.15 # Propositional unsat checks : 0
% 0.65/300.15 # Propositional check models : 0
% 0.65/300.15 # Propositional check unsatisfiable : 0
% 0.65/300.15 # Propositional clauses : 0
% 0.65/300.15 # Propositional clauses after purity: 0
% 0.65/300.15 # Propositional unsat core size : 0
% 0.65/300.15 # Propositional preprocessing time : 0.000
% 0.65/300.15 # Propositional encoding time : 0.000
% 0.65/300.15 # Propositional solver time : 0.000
% 0.65/300.15 # Success case prop preproc time : 0.000
% 0.65/300.15 # Success case prop encoding time : 0.000
% 0.65/300.15 # Success case prop solver time : 0.000
% 0.65/300.15 # Current number of processed clauses : 132
% 0.65/300.15 # Positive orientable unit clauses : 27
% 0.65/300.15 # Positive unorientable unit clauses: 0
% 0.65/300.15 # Negative unit clauses : 10
% 0.65/300.15 # Non-unit-clauses : 95
% 0.65/300.15 # Current number of unprocessed clauses: 129
% 0.65/300.15 # ...number of literals in the above : 358
% 0.65/300.15 # Current number of archived formulas : 0
% 0.65/300.15 # Current number of archived clauses : 115
% 0.65/300.15 # Clause-clause subsumption calls (NU) : 1834
% 0.65/300.15 # Rec. Clause-clause subsumption calls : 1525
% 0.65/300.15 # Non-unit clause-clause subsumptions : 35
% 0.65/300.15 # Unit Clause-clause subsumption calls : 154
% 0.65/300.15 # Rewrite failures with RHS unbound : 0
% 0.65/300.15 # BW rewrite match attempts : 14
% 0.65/300.15 # BW rewrite match successes : 10
% 0.65/300.15 # Condensation attempts : 0
% 0.65/300.15 # Condensation successes : 0
% 0.65/300.15 # Termbank termtop insertions : 12990
% 0.65/300.15
% 0.65/300.15 # -------------------------------------------------
% 0.65/300.15 # User time : 0.018 s
% 0.65/300.15 # System time : 0.004 s
% 0.65/300.15 # Total time : 0.022 s
% 0.65/300.15 # Maximum resident set size: 2324 pages
% 0.65/300.15
% 0.65/300.15 # -------------------------------------------------
% 0.65/300.15 # User time : 0.026 s
% 0.65/300.15 # System time : 0.006 s
% 0.65/300.15 # Total time : 0.032 s
% 0.65/300.15 # Maximum resident set size: 2056 pages
% 0.65/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------