TSTP Solution File: SEU254+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU254+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:03 EDT 2024
% Result : Theorem 1.07s 0.63s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 4 unt; 0 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 151 ( 60 ~; 68 |; 12 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 83 ( 7 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ys40blfRa1/E---3.1_4681.p',t16_wellord1) ).
fof(l2_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X4),X1) )
=> in(ordered_pair(X2,X4),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ys40blfRa1/E---3.1_4681.p',l2_wellord1) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.ys40blfRa1/E---3.1_4681.p',dt_k2_wellord1) ).
fof(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ys40blfRa1/E---3.1_4681.p',t106_zfmisc_1) ).
fof(t24_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( transitive(X2)
=> transitive(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ys40blfRa1/E---3.1_4681.p',t24_wellord1) ).
fof(c_0_5,plain,
! [X18,X19,X20] :
( ( in(X18,X20)
| ~ in(X18,relation_restriction(X20,X19))
| ~ relation(X20) )
& ( in(X18,cartesian_product2(X19,X19))
| ~ in(X18,relation_restriction(X20,X19))
| ~ relation(X20) )
& ( ~ in(X18,X20)
| ~ in(X18,cartesian_product2(X19,X19))
| in(X18,relation_restriction(X20,X19))
| ~ relation(X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])])]) ).
fof(c_0_6,plain,
! [X7,X8,X9,X10] :
( ( ~ transitive(X7)
| ~ in(ordered_pair(X8,X9),X7)
| ~ in(ordered_pair(X9,X10),X7)
| in(ordered_pair(X8,X10),X7)
| ~ relation(X7) )
& ( in(ordered_pair(esk3_1(X7),esk4_1(X7)),X7)
| transitive(X7)
| ~ relation(X7) )
& ( in(ordered_pair(esk4_1(X7),esk5_1(X7)),X7)
| transitive(X7)
| ~ relation(X7) )
& ( ~ in(ordered_pair(esk3_1(X7),esk5_1(X7)),X7)
| transitive(X7)
| ~ relation(X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_wellord1])])])])])]) ).
fof(c_0_7,plain,
! [X16,X17] :
( ~ relation(X16)
| relation(relation_restriction(X16,X17)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])]) ).
fof(c_0_8,plain,
! [X27,X28,X29,X30] :
( ( in(X27,X29)
| ~ in(ordered_pair(X27,X28),cartesian_product2(X29,X30)) )
& ( in(X28,X30)
| ~ in(ordered_pair(X27,X28),cartesian_product2(X29,X30)) )
& ( ~ in(X27,X29)
| ~ in(X28,X30)
| in(ordered_pair(X27,X28),cartesian_product2(X29,X30)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t106_zfmisc_1])])])]) ).
cnf(c_0_9,plain,
( in(X1,cartesian_product2(X2,X2))
| ~ in(X1,relation_restriction(X3,X2))
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( in(ordered_pair(esk3_1(X1),esk4_1(X1)),X1)
| transitive(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( in(ordered_pair(esk4_1(X1),esk5_1(X1)),X1)
| transitive(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( in(X1,relation_restriction(X2,X3))
| ~ in(X1,X2)
| ~ in(X1,cartesian_product2(X3,X3))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( in(ordered_pair(X1,X3),cartesian_product2(X2,X4))
| ~ in(X1,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( in(X1,X2)
| ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( transitive(relation_restriction(X1,X2))
| in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk4_1(relation_restriction(X1,X2))),cartesian_product2(X2,X2))
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_17,plain,
( in(X1,X2)
| ~ in(ordered_pair(X3,X1),cartesian_product2(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( transitive(relation_restriction(X1,X2))
| in(ordered_pair(esk4_1(relation_restriction(X1,X2)),esk5_1(relation_restriction(X1,X2))),cartesian_product2(X2,X2))
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_11]) ).
cnf(c_0_19,plain,
( in(X1,X2)
| ~ in(X1,relation_restriction(X2,X3))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( transitive(X2)
=> transitive(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[t24_wellord1]) ).
cnf(c_0_21,plain,
( transitive(X1)
| ~ in(ordered_pair(esk3_1(X1),esk5_1(X1)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,plain,
( in(ordered_pair(X1,X2),relation_restriction(X3,X4))
| ~ relation(X3)
| ~ in(ordered_pair(X1,X2),X3)
| ~ in(X2,X4)
| ~ in(X1,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_23,plain,
( transitive(relation_restriction(X1,X2))
| in(esk3_1(relation_restriction(X1,X2)),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
( transitive(relation_restriction(X1,X2))
| in(esk5_1(relation_restriction(X1,X2)),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( in(ordered_pair(X2,X4),X1)
| ~ transitive(X1)
| ~ in(ordered_pair(X2,X3),X1)
| ~ in(ordered_pair(X3,X4),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,plain,
( transitive(relation_restriction(X1,X2))
| in(ordered_pair(esk4_1(relation_restriction(X1,X2)),esk5_1(relation_restriction(X1,X2))),X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_11]) ).
fof(c_0_27,negated_conjecture,
( relation(esk2_0)
& transitive(esk2_0)
& ~ transitive(relation_restriction(esk2_0,esk1_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_28,plain,
( transitive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk5_1(relation_restriction(X1,X2))),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_11]) ).
cnf(c_0_29,plain,
( transitive(relation_restriction(X1,X2))
| in(ordered_pair(X3,esk5_1(relation_restriction(X1,X2))),X1)
| ~ transitive(X1)
| ~ relation(X1)
| ~ in(ordered_pair(X3,esk4_1(relation_restriction(X1,X2))),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( transitive(relation_restriction(X1,X2))
| in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk4_1(relation_restriction(X1,X2))),X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_11]) ).
cnf(c_0_31,negated_conjecture,
~ transitive(relation_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( transitive(relation_restriction(X1,X2))
| ~ transitive(X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
transitive(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU254+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.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 : Fri May 3 07:53:56 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.51 Running first-order model finding
% 0.20/0.51 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.ys40blfRa1/E---3.1_4681.p
% 1.07/0.63 # Version: 3.1.0
% 1.07/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.07/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.07/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.07/0.63 # Starting sh5l with 300s (1) cores
% 1.07/0.63 # new_bool_1 with pid 4805 completed with status 0
% 1.07/0.63 # Result found by new_bool_1
% 1.07/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.07/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.07/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.07/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/0.63 # Search class: FGHSS-FFSS21-SFFFFFNN
% 1.07/0.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.07/0.63 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.07/0.63 # SAT001_MinMin_p005000_rr_RG with pid 4813 completed with status 0
% 1.07/0.63 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.07/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.07/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.07/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.07/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/0.63 # Search class: FGHSS-FFSS21-SFFFFFNN
% 1.07/0.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.07/0.63 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.07/0.63 # Preprocessing time : 0.002 s
% 1.07/0.63 # Presaturation interreduction done
% 1.07/0.63
% 1.07/0.63 # Proof found!
% 1.07/0.63 # SZS status Theorem
% 1.07/0.63 # SZS output start CNFRefutation
% See solution above
% 1.07/0.63 # Parsed axioms : 34
% 1.07/0.63 # Removed by relevancy pruning/SinE : 17
% 1.07/0.63 # Initial clauses : 26
% 1.07/0.63 # Removed in clause preprocessing : 0
% 1.07/0.63 # Initial clauses in saturation : 26
% 1.07/0.63 # Processed clauses : 949
% 1.07/0.63 # ...of these trivial : 1
% 1.07/0.63 # ...subsumed : 627
% 1.07/0.63 # ...remaining for further processing : 321
% 1.07/0.63 # Other redundant clauses eliminated : 0
% 1.07/0.63 # Clauses deleted for lack of memory : 0
% 1.07/0.63 # Backward-subsumed : 49
% 1.07/0.63 # Backward-rewritten : 1
% 1.07/0.63 # Generated clauses : 1659
% 1.07/0.63 # ...of the previous two non-redundant : 1589
% 1.07/0.63 # ...aggressively subsumed : 0
% 1.07/0.63 # Contextual simplify-reflections : 64
% 1.07/0.63 # Paramodulations : 1659
% 1.07/0.63 # Factorizations : 0
% 1.07/0.63 # NegExts : 0
% 1.07/0.63 # Equation resolutions : 0
% 1.07/0.63 # Disequality decompositions : 0
% 1.07/0.63 # Total rewrite steps : 27
% 1.07/0.63 # ...of those cached : 20
% 1.07/0.63 # Propositional unsat checks : 0
% 1.07/0.63 # Propositional check models : 0
% 1.07/0.63 # Propositional check unsatisfiable : 0
% 1.07/0.63 # Propositional clauses : 0
% 1.07/0.63 # Propositional clauses after purity: 0
% 1.07/0.63 # Propositional unsat core size : 0
% 1.07/0.63 # Propositional preprocessing time : 0.000
% 1.07/0.63 # Propositional encoding time : 0.000
% 1.07/0.63 # Propositional solver time : 0.000
% 1.07/0.63 # Success case prop preproc time : 0.000
% 1.07/0.63 # Success case prop encoding time : 0.000
% 1.07/0.63 # Success case prop solver time : 0.000
% 1.07/0.63 # Current number of processed clauses : 245
% 1.07/0.63 # Positive orientable unit clauses : 7
% 1.07/0.63 # Positive unorientable unit clauses: 1
% 1.07/0.63 # Negative unit clauses : 6
% 1.07/0.63 # Non-unit-clauses : 231
% 1.07/0.63 # Current number of unprocessed clauses: 651
% 1.07/0.63 # ...number of literals in the above : 3427
% 1.07/0.63 # Current number of archived formulas : 0
% 1.07/0.63 # Current number of archived clauses : 76
% 1.07/0.63 # Clause-clause subsumption calls (NU) : 18827
% 1.07/0.63 # Rec. Clause-clause subsumption calls : 8645
% 1.07/0.63 # Non-unit clause-clause subsumptions : 739
% 1.07/0.63 # Unit Clause-clause subsumption calls : 37
% 1.07/0.63 # Rewrite failures with RHS unbound : 0
% 1.07/0.63 # BW rewrite match attempts : 9
% 1.07/0.63 # BW rewrite match successes : 9
% 1.07/0.63 # Condensation attempts : 0
% 1.07/0.63 # Condensation successes : 0
% 1.07/0.63 # Termbank termtop insertions : 38850
% 1.07/0.63 # Search garbage collected termcells : 370
% 1.07/0.63
% 1.07/0.63 # -------------------------------------------------
% 1.07/0.63 # User time : 0.097 s
% 1.07/0.63 # System time : 0.002 s
% 1.07/0.63 # Total time : 0.099 s
% 1.07/0.63 # Maximum resident set size: 1836 pages
% 1.07/0.63
% 1.07/0.63 # -------------------------------------------------
% 1.07/0.63 # User time : 0.098 s
% 1.07/0.63 # System time : 0.006 s
% 1.07/0.63 # Total time : 0.104 s
% 1.07/0.63 # Maximum resident set size: 1712 pages
% 1.07/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------