TSTP Solution File: SEU177+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU177+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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 : 600s
% DateTime : Tue Jul 19 09:17:29 EDT 2022
% Result : Theorem 0.22s 1.39s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 71 ( 14 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 88 ( 34 ~; 34 |; 10 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 38 ( 6 sgn 26 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t20_relat_1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t20_relat_1) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_relat_1) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
inference(assume_negation,[status(cth)],[t20_relat_1]) ).
fof(c_0_4,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( ~ in(X7,X6)
| in(ordered_pair(X7,esk7_3(X5,X6,X7)),X5)
| X6 != relation_dom(X5)
| ~ relation(X5) )
& ( ~ in(ordered_pair(X7,X9),X5)
| in(X7,X6)
| X6 != relation_dom(X5)
| ~ relation(X5) )
& ( ~ in(esk8_2(X5,X6),X6)
| ~ in(ordered_pair(esk8_2(X5,X6),X11),X5)
| X6 = relation_dom(X5)
| ~ relation(X5) )
& ( in(esk8_2(X5,X6),X6)
| in(ordered_pair(esk8_2(X5,X6),esk9_2(X5,X6)),X5)
| X6 = relation_dom(X5)
| ~ relation(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_relat_1])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( relation(esk3_0)
& in(ordered_pair(esk1_0,esk2_0),esk3_0)
& ( ~ in(esk1_0,relation_dom(esk3_0))
| ~ in(esk2_0,relation_rng(esk3_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( in(X3,X2)
| ~ relation(X1)
| X2 != relation_dom(X1)
| ~ in(ordered_pair(X3,X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
in(ordered_pair(esk1_0,esk2_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( ~ in(X7,X6)
| in(ordered_pair(esk4_3(X5,X6,X7),X7),X5)
| X6 != relation_rng(X5)
| ~ relation(X5) )
& ( ~ in(ordered_pair(X9,X7),X5)
| in(X7,X6)
| X6 != relation_rng(X5)
| ~ relation(X5) )
& ( ~ in(esk5_2(X5,X6),X6)
| ~ in(ordered_pair(X11,esk5_2(X5,X6)),X5)
| X6 = relation_rng(X5)
| ~ relation(X5) )
& ( in(esk5_2(X5,X6),X6)
| in(ordered_pair(esk6_2(X5,X6),esk5_2(X5,X6)),X5)
| X6 = relation_rng(X5)
| ~ relation(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_relat_1])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( in(esk1_0,X1)
| X1 != relation_dom(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,plain,
( in(X3,X2)
| ~ relation(X1)
| X2 != relation_rng(X1)
| ~ in(ordered_pair(X4,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ in(esk2_0,relation_rng(esk3_0))
| ~ in(esk1_0,relation_dom(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
in(esk1_0,relation_dom(esk3_0)),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( in(esk2_0,X1)
| X1 != relation_rng(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_7]),c_0_8])]) ).
cnf(c_0_15,negated_conjecture,
~ in(esk2_0,relation_rng(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU177+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 07:14:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.39 # Preprocessing time : 0.016 s
% 0.22/1.39
% 0.22/1.39 # Proof found!
% 0.22/1.39 # SZS status Theorem
% 0.22/1.39 # SZS output start CNFRefutation
% See solution above
% 0.22/1.39 # Proof object total steps : 17
% 0.22/1.39 # Proof object clause steps : 10
% 0.22/1.39 # Proof object formula steps : 7
% 0.22/1.39 # Proof object conjectures : 11
% 0.22/1.39 # Proof object clause conjectures : 8
% 0.22/1.39 # Proof object formula conjectures : 3
% 0.22/1.39 # Proof object initial clauses used : 5
% 0.22/1.39 # Proof object initial formulas used : 3
% 0.22/1.39 # Proof object generating inferences : 4
% 0.22/1.39 # Proof object simplifying inferences : 7
% 0.22/1.39 # Training examples: 0 positive, 0 negative
% 0.22/1.39 # Parsed axioms : 26
% 0.22/1.39 # Removed by relevancy pruning/SinE : 16
% 0.22/1.39 # Initial clauses : 19
% 0.22/1.39 # Removed in clause preprocessing : 0
% 0.22/1.39 # Initial clauses in saturation : 19
% 0.22/1.39 # Processed clauses : 27
% 0.22/1.39 # ...of these trivial : 0
% 0.22/1.39 # ...subsumed : 0
% 0.22/1.39 # ...remaining for further processing : 27
% 0.22/1.39 # Other redundant clauses eliminated : 0
% 0.22/1.39 # Clauses deleted for lack of memory : 0
% 0.22/1.39 # Backward-subsumed : 0
% 0.22/1.39 # Backward-rewritten : 1
% 0.22/1.39 # Generated clauses : 30
% 0.22/1.39 # ...of the previous two non-trivial : 28
% 0.22/1.39 # Contextual simplify-reflections : 0
% 0.22/1.39 # Paramodulations : 28
% 0.22/1.39 # Factorizations : 0
% 0.22/1.39 # Equation resolutions : 2
% 0.22/1.39 # Current number of processed clauses : 26
% 0.22/1.39 # Positive orientable unit clauses : 6
% 0.22/1.39 # Positive unorientable unit clauses: 0
% 0.22/1.39 # Negative unit clauses : 7
% 0.22/1.39 # Non-unit-clauses : 13
% 0.22/1.39 # Current number of unprocessed clauses: 20
% 0.22/1.39 # ...number of literals in the above : 86
% 0.22/1.39 # Current number of archived formulas : 0
% 0.22/1.39 # Current number of archived clauses : 1
% 0.22/1.39 # Clause-clause subsumption calls (NU) : 14
% 0.22/1.39 # Rec. Clause-clause subsumption calls : 9
% 0.22/1.39 # Non-unit clause-clause subsumptions : 0
% 0.22/1.39 # Unit Clause-clause subsumption calls : 10
% 0.22/1.39 # Rewrite failures with RHS unbound : 0
% 0.22/1.39 # BW rewrite match attempts : 1
% 0.22/1.39 # BW rewrite match successes : 1
% 0.22/1.39 # Condensation attempts : 0
% 0.22/1.39 # Condensation successes : 0
% 0.22/1.39 # Termbank termtop insertions : 1699
% 0.22/1.39
% 0.22/1.39 # -------------------------------------------------
% 0.22/1.39 # User time : 0.014 s
% 0.22/1.39 # System time : 0.003 s
% 0.22/1.39 # Total time : 0.017 s
% 0.22/1.39 # Maximum resident set size: 2964 pages
%------------------------------------------------------------------------------