TSTP Solution File: SEU242+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU242+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:00 EDT 2024
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 4 unt; 0 def)
% Number of atoms : 164 ( 20 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 211 ( 81 ~; 92 |; 28 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d6_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_connected_in(X1,X2)
<=> ! [X3,X4] :
~ ( in(X3,X2)
& in(X4,X2)
& X3 != X4
& ~ in(ordered_pair(X3,X4),X1)
& ~ in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W54SyNMWJE/E---3.1_11707.p',d6_relat_2) ).
fof(d14_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( connected(X1)
<=> is_connected_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W54SyNMWJE/E---3.1_11707.p',d14_relat_2) ).
fof(l4_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,relation_field(X1))
& in(X3,relation_field(X1))
& X2 != X3
& ~ in(ordered_pair(X2,X3),X1)
& ~ in(ordered_pair(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W54SyNMWJE/E---3.1_11707.p',l4_wellord1) ).
fof(c_0_3,plain,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_connected_in(X1,X2)
<=> ! [X3,X4] :
~ ( in(X3,X2)
& in(X4,X2)
& X3 != X4
& ~ in(ordered_pair(X3,X4),X1)
& ~ in(ordered_pair(X4,X3),X1) ) ) ),
inference(fof_simplification,[status(thm)],[d6_relat_2]) ).
fof(c_0_4,plain,
! [X21,X22,X23,X24,X25] :
( ( ~ is_connected_in(X21,X22)
| ~ in(X23,X22)
| ~ in(X24,X22)
| X23 = X24
| in(ordered_pair(X23,X24),X21)
| in(ordered_pair(X24,X23),X21)
| ~ relation(X21) )
& ( in(esk6_2(X21,X25),X25)
| is_connected_in(X21,X25)
| ~ relation(X21) )
& ( in(esk7_2(X21,X25),X25)
| is_connected_in(X21,X25)
| ~ relation(X21) )
& ( esk6_2(X21,X25) != esk7_2(X21,X25)
| is_connected_in(X21,X25)
| ~ relation(X21) )
& ( ~ in(ordered_pair(esk6_2(X21,X25),esk7_2(X21,X25)),X21)
| is_connected_in(X21,X25)
| ~ relation(X21) )
& ( ~ in(ordered_pair(esk7_2(X21,X25),esk6_2(X21,X25)),X21)
| is_connected_in(X21,X25)
| ~ relation(X21) ) ),
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)],[c_0_3])])])])])])]) ).
fof(c_0_5,plain,
! [X16] :
( ( ~ connected(X16)
| is_connected_in(X16,relation_field(X16))
| ~ relation(X16) )
& ( ~ is_connected_in(X16,relation_field(X16))
| connected(X16)
| ~ relation(X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d14_relat_2])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,relation_field(X1))
& in(X3,relation_field(X1))
& X2 != X3
& ~ in(ordered_pair(X2,X3),X1)
& ~ in(ordered_pair(X3,X2),X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l4_wellord1])]) ).
cnf(c_0_7,plain,
( X3 = X4
| in(ordered_pair(X3,X4),X1)
| in(ordered_pair(X4,X3),X1)
| ~ is_connected_in(X1,X2)
| ~ in(X3,X2)
| ~ in(X4,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( is_connected_in(X1,relation_field(X1))
| ~ connected(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
! [X8,X9] :
( relation(esk1_0)
& ( in(esk2_0,relation_field(esk1_0))
| ~ connected(esk1_0) )
& ( in(esk3_0,relation_field(esk1_0))
| ~ connected(esk1_0) )
& ( esk2_0 != esk3_0
| ~ connected(esk1_0) )
& ( ~ in(ordered_pair(esk2_0,esk3_0),esk1_0)
| ~ connected(esk1_0) )
& ( ~ in(ordered_pair(esk3_0,esk2_0),esk1_0)
| ~ connected(esk1_0) )
& ( connected(esk1_0)
| ~ in(X8,relation_field(esk1_0))
| ~ in(X9,relation_field(esk1_0))
| X8 = X9
| in(ordered_pair(X8,X9),esk1_0)
| in(ordered_pair(X9,X8),esk1_0) ) ),
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)],[c_0_6])])])])])]) ).
cnf(c_0_10,plain,
( X1 = X2
| in(ordered_pair(X1,X2),X3)
| in(ordered_pair(X2,X1),X3)
| ~ connected(X3)
| ~ relation(X3)
| ~ in(X2,relation_field(X3))
| ~ in(X1,relation_field(X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( in(esk3_0,relation_field(esk1_0))
| ~ connected(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( X1 = esk3_0
| in(ordered_pair(esk3_0,X1),esk1_0)
| in(ordered_pair(X1,esk3_0),esk1_0)
| ~ connected(esk1_0)
| ~ in(X1,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_14,negated_conjecture,
( in(esk2_0,relation_field(esk1_0))
| ~ connected(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ in(ordered_pair(esk2_0,esk3_0),esk1_0)
| ~ connected(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( ~ in(ordered_pair(esk3_0,esk2_0),esk1_0)
| ~ connected(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( esk2_0 != esk3_0
| ~ connected(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( connected(esk1_0)
| X1 = X2
| in(ordered_pair(X1,X2),esk1_0)
| in(ordered_pair(X2,X1),esk1_0)
| ~ in(X1,relation_field(esk1_0))
| ~ in(X2,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( in(esk7_2(X1,X2),X2)
| is_connected_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,negated_conjecture,
~ connected(esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( X1 = esk7_2(X2,relation_field(esk1_0))
| is_connected_in(X2,relation_field(esk1_0))
| in(ordered_pair(X1,esk7_2(X2,relation_field(esk1_0))),esk1_0)
| in(ordered_pair(esk7_2(X2,relation_field(esk1_0)),X1),esk1_0)
| ~ relation(X2)
| ~ in(X1,relation_field(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,plain,
( in(esk6_2(X1,X2),X2)
| is_connected_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( esk6_2(X1,relation_field(esk1_0)) = esk7_2(X2,relation_field(esk1_0))
| is_connected_in(X1,relation_field(esk1_0))
| is_connected_in(X2,relation_field(esk1_0))
| in(ordered_pair(esk7_2(X2,relation_field(esk1_0)),esk6_2(X1,relation_field(esk1_0))),esk1_0)
| in(ordered_pair(esk6_2(X1,relation_field(esk1_0)),esk7_2(X2,relation_field(esk1_0))),esk1_0)
| ~ relation(X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( esk6_2(X1,relation_field(esk1_0)) = esk7_2(esk1_0,relation_field(esk1_0))
| is_connected_in(esk1_0,relation_field(esk1_0))
| is_connected_in(X1,relation_field(esk1_0))
| in(ordered_pair(esk6_2(X1,relation_field(esk1_0)),esk7_2(esk1_0,relation_field(esk1_0))),esk1_0)
| in(ordered_pair(esk7_2(esk1_0,relation_field(esk1_0)),esk6_2(X1,relation_field(esk1_0))),esk1_0)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_25,plain,
( is_connected_in(X1,X2)
| ~ in(ordered_pair(esk7_2(X1,X2),esk6_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_26,negated_conjecture,
( esk7_2(esk1_0,relation_field(esk1_0)) = esk6_2(esk1_0,relation_field(esk1_0))
| is_connected_in(esk1_0,relation_field(esk1_0))
| in(ordered_pair(esk7_2(esk1_0,relation_field(esk1_0)),esk6_2(esk1_0,relation_field(esk1_0))),esk1_0)
| in(ordered_pair(esk6_2(esk1_0,relation_field(esk1_0)),esk7_2(esk1_0,relation_field(esk1_0))),esk1_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_12]) ).
cnf(c_0_27,plain,
( is_connected_in(X1,X2)
| ~ in(ordered_pair(esk6_2(X1,X2),esk7_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_28,negated_conjecture,
( esk7_2(esk1_0,relation_field(esk1_0)) = esk6_2(esk1_0,relation_field(esk1_0))
| is_connected_in(esk1_0,relation_field(esk1_0))
| in(ordered_pair(esk6_2(esk1_0,relation_field(esk1_0)),esk7_2(esk1_0,relation_field(esk1_0))),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_12])]) ).
cnf(c_0_29,plain,
( is_connected_in(X1,X2)
| esk6_2(X1,X2) != esk7_2(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_30,negated_conjecture,
( esk7_2(esk1_0,relation_field(esk1_0)) = esk6_2(esk1_0,relation_field(esk1_0))
| is_connected_in(esk1_0,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_12])]) ).
cnf(c_0_31,plain,
( connected(X1)
| ~ is_connected_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_32,negated_conjecture,
is_connected_in(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_12])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_12])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU242+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.09/0.31 % Computer : n006.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Fri May 3 07:49:49 EDT 2024
% 0.09/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.W54SyNMWJE/E---3.1_11707.p
% 0.15/0.43 # Version: 3.1.0
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_3 with pid 11786 completed with status 0
% 0.15/0.43 # Result found by new_bool_3
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43 # SAT001_MinMin_p005000_rr_RG with pid 11789 completed with status 0
% 0.15/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 36
% 0.15/0.43 # Removed by relevancy pruning/SinE : 27
% 0.15/0.43 # Initial clauses : 21
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 21
% 0.15/0.43 # Processed clauses : 73
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 5
% 0.15/0.43 # ...remaining for further processing : 68
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 11
% 0.15/0.43 # Backward-rewritten : 3
% 0.15/0.43 # Generated clauses : 51
% 0.15/0.43 # ...of the previous two non-redundant : 47
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 3
% 0.15/0.43 # Paramodulations : 51
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 14
% 0.15/0.43 # ...of those cached : 12
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 33
% 0.15/0.43 # Positive orientable unit clauses : 3
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 3
% 0.15/0.43 # Non-unit-clauses : 27
% 0.15/0.43 # Current number of unprocessed clauses: 12
% 0.15/0.43 # ...number of literals in the above : 55
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 35
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 571
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 133
% 0.15/0.43 # Non-unit clause-clause subsumptions : 10
% 0.15/0.43 # Unit Clause-clause subsumption calls : 20
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 1
% 0.15/0.43 # BW rewrite match successes : 1
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 3509
% 0.15/0.43 # Search garbage collected termcells : 495
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.009 s
% 0.15/0.43 # System time : 0.000 s
% 0.15/0.43 # Total time : 0.009 s
% 0.15/0.43 # Maximum resident set size: 1824 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.009 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.012 s
% 0.15/0.43 # Maximum resident set size: 1720 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------