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