TSTP Solution File: SEU245+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU245+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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:18:15 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 94 ( 18 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 106 ( 41 ~; 47 |; 11 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 56 ( 7 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_xboole_0) ).
fof(d6_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] : relation_restriction(X1,X2) = set_intersection2(X1,cartesian_product2(X2,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d6_wellord1) ).
fof(t16_wellord1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t16_wellord1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(c_0_4,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk4_3(X5,X6,X7),X7)
| ~ in(esk4_3(X5,X6,X7),X5)
| ~ in(esk4_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk4_3(X5,X6,X7),X5)
| in(esk4_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk4_3(X5,X6,X7),X6)
| in(esk4_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) ) ),
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)],[d3_xboole_0])])])])])])]) ).
fof(c_0_5,plain,
! [X3,X4] :
( ~ relation(X3)
| relation_restriction(X3,X4) = set_intersection2(X3,cartesian_product2(X4,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d6_wellord1])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
inference(assume_negation,[status(cth)],[t16_wellord1]) ).
fof(c_0_7,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_8,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( relation_restriction(X1,X2) = set_intersection2(X1,cartesian_product2(X2,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
( relation(esk3_0)
& ( ~ in(esk1_0,relation_restriction(esk3_0,esk2_0))
| ~ in(esk1_0,esk3_0)
| ~ in(esk1_0,cartesian_product2(esk2_0,esk2_0)) )
& ( in(esk1_0,esk3_0)
| in(esk1_0,relation_restriction(esk3_0,esk2_0)) )
& ( in(esk1_0,cartesian_product2(esk2_0,esk2_0))
| in(esk1_0,relation_restriction(esk3_0,esk2_0)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_11,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| X2 != relation_restriction(X3,X4)
| ~ in(X1,cartesian_product2(X4,X4))
| ~ in(X1,X3)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( in(esk1_0,relation_restriction(esk3_0,esk2_0))
| in(esk1_0,cartesian_product2(esk2_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( relation_restriction(X1,X2) = set_intersection2(cartesian_product2(X2,X2),X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( in(esk1_0,relation_restriction(esk3_0,esk2_0))
| in(esk1_0,X1)
| X1 != relation_restriction(X2,esk2_0)
| ~ in(esk1_0,X2)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( in(X1,X2)
| ~ in(X1,relation_restriction(X2,X3))
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( in(esk1_0,relation_restriction(esk3_0,esk2_0))
| in(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( in(esk1_0,relation_restriction(esk3_0,esk2_0))
| in(esk1_0,relation_restriction(X1,esk2_0))
| ~ in(esk1_0,X1)
| ~ relation(X1) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
in(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
( ~ in(esk1_0,cartesian_product2(esk2_0,esk2_0))
| ~ in(esk1_0,esk3_0)
| ~ in(esk1_0,relation_restriction(esk3_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,plain,
( in(X1,cartesian_product2(X2,X2))
| ~ in(X1,relation_restriction(X3,X2))
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_25,negated_conjecture,
in(esk1_0,relation_restriction(esk3_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
( ~ in(esk1_0,relation_restriction(esk3_0,esk2_0))
| ~ in(esk1_0,cartesian_product2(esk2_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
in(esk1_0,cartesian_product2(esk2_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_25])]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU245+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Mon Jun 20 11:34:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.016 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 29
% 0.21/1.40 # Proof object clause steps : 20
% 0.21/1.40 # Proof object formula steps : 9
% 0.21/1.40 # Proof object conjectures : 14
% 0.21/1.40 # Proof object clause conjectures : 11
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 8
% 0.21/1.40 # Proof object initial formulas used : 4
% 0.21/1.40 # Proof object generating inferences : 10
% 0.21/1.40 # Proof object simplifying inferences : 12
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 26
% 0.21/1.40 # Removed by relevancy pruning/SinE : 12
% 0.21/1.40 # Initial clauses : 25
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 25
% 0.21/1.40 # Processed clauses : 83
% 0.21/1.40 # ...of these trivial : 1
% 0.21/1.40 # ...subsumed : 26
% 0.21/1.40 # ...remaining for further processing : 55
% 0.21/1.40 # Other redundant clauses eliminated : 3
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 14
% 0.21/1.40 # Generated clauses : 140
% 0.21/1.40 # ...of the previous two non-trivial : 124
% 0.21/1.40 # Contextual simplify-reflections : 2
% 0.21/1.40 # Paramodulations : 127
% 0.21/1.40 # Factorizations : 4
% 0.21/1.40 # Equation resolutions : 9
% 0.21/1.40 # Current number of processed clauses : 41
% 0.21/1.40 # Positive orientable unit clauses : 11
% 0.21/1.40 # Positive unorientable unit clauses: 1
% 0.21/1.40 # Negative unit clauses : 4
% 0.21/1.40 # Non-unit-clauses : 25
% 0.21/1.40 # Current number of unprocessed clauses: 62
% 0.21/1.40 # ...number of literals in the above : 208
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 14
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 436
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 298
% 0.21/1.40 # Non-unit clause-clause subsumptions : 28
% 0.21/1.40 # Unit Clause-clause subsumption calls : 30
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 5
% 0.21/1.40 # BW rewrite match successes : 5
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 2706
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.017 s
% 0.21/1.40 # System time : 0.004 s
% 0.21/1.40 # Total time : 0.021 s
% 0.21/1.40 # Maximum resident set size: 2964 pages
%------------------------------------------------------------------------------