TSTP Solution File: SEU267+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU267+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Sat May 4 09:31:07 EDT 2024
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 3 unt; 0 def)
% Number of atoms : 51 ( 50 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 61 ( 25 ~; 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.sF0BemO57Q/E---3.1_13931.p',d2_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.sF0BemO57Q/E---3.1_13931.p',d1_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.sF0BemO57Q/E---3.1_13931.p',t7_mcart_1) ).
fof(c_0_3,plain,
! [X7,X8,X9,X10,X11,X12,X13] :
( ( X10 != pair_second(X7)
| X7 != ordered_pair(X11,X12)
| X10 = X12
| X7 != ordered_pair(X8,X9) )
& ( X7 = ordered_pair(esk3_2(X7,X13),esk4_2(X7,X13))
| X13 = pair_second(X7)
| X7 != ordered_pair(X8,X9) )
& ( X13 != esk4_2(X7,X13)
| X13 = pair_second(X7)
| X7 != ordered_pair(X8,X9) ) ),
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_mcart_1])])])])])])]) ).
fof(c_0_4,plain,
! [X18,X19,X20,X21,X22,X23,X24] :
( ( X21 != pair_first(X18)
| X18 != ordered_pair(X22,X23)
| X21 = X22
| X18 != ordered_pair(X19,X20) )
& ( X18 = ordered_pair(esk5_2(X18,X24),esk6_2(X18,X24))
| X24 = pair_first(X18)
| X18 != ordered_pair(X19,X20) )
& ( X24 != esk5_2(X18,X24)
| X24 = pair_first(X18)
| X18 != ordered_pair(X19,X20) ) ),
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_mcart_1])])])])])])]) ).
fof(c_0_5,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_6,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]) ).
cnf(c_0_7,plain,
( X1 = X3
| X1 != pair_first(X2)
| X2 != ordered_pair(X3,X4)
| X2 != ordered_pair(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( pair_first(ordered_pair(esk1_0,esk2_0)) != esk1_0
| pair_second(ordered_pair(esk1_0,esk2_0)) != esk2_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_9,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_6])]) ).
cnf(c_0_10,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_7])]) ).
cnf(c_0_11,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_8]) ).
cnf(c_0_12,plain,
pair_second(ordered_pair(X1,X2)) = X2,
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
pair_first(ordered_pair(X1,X2)) = X1,
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU267+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n013.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 07:43:19 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.sF0BemO57Q/E---3.1_13931.p
% 0.16/0.43 # Version: 3.1.0
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # new_bool_3 with pid 14009 completed with status 0
% 0.16/0.43 # Result found by new_bool_3
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # SAT001_MinMin_p005000_rr_RG with pid 14012 completed with status 0
% 0.16/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Theorem
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 19
% 0.16/0.43 # Removed by relevancy pruning/SinE : 12
% 0.16/0.43 # Initial clauses : 11
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 11
% 0.16/0.43 # Processed clauses : 30
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 0
% 0.16/0.43 # ...remaining for further processing : 29
% 0.16/0.43 # Other redundant clauses eliminated : 8
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 5
% 0.16/0.43 # Generated clauses : 9
% 0.16/0.43 # ...of the previous two non-redundant : 14
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 1
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 10
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 6
% 0.16/0.43 # ...of those cached : 0
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 7
% 0.16/0.43 # Positive orientable unit clauses : 3
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 2
% 0.16/0.43 # Non-unit-clauses : 2
% 0.16/0.43 # Current number of unprocessed clauses: 6
% 0.16/0.43 # ...number of literals in the above : 12
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 16
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 10
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 10
% 0.16/0.43 # Non-unit clause-clause subsumptions : 0
% 0.16/0.43 # Unit Clause-clause subsumption calls : 0
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 5
% 0.16/0.43 # BW rewrite match successes : 5
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 938
% 0.16/0.43 # Search garbage collected termcells : 314
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.002 s
% 0.16/0.43 # System time : 0.004 s
% 0.16/0.43 # Total time : 0.005 s
% 0.16/0.43 # Maximum resident set size: 1708 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.002 s
% 0.16/0.43 # System time : 0.006 s
% 0.16/0.43 # Total time : 0.008 s
% 0.16/0.43 # Maximum resident set size: 1696 pages
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------