TSTP Solution File: SEU166+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU166+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:23 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 5 unt; 0 def)
% Number of atoms : 131 ( 36 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 170 ( 73 ~; 77 |; 14 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 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; 4 con; 0-4 aty)
% Number of variables : 111 ( 6 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_zfmisc_1,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( in(X5,X1)
& in(X6,X2)
& X4 = ordered_pair(X5,X6) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_zfmisc_1) ).
fof(t118_zfmisc_1,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))
& subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t118_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(c_0_3,plain,
! [X7,X8,X9,X10,X10,X13,X14,X7,X8,X9,X16,X17] :
( ( in(esk6_4(X7,X8,X9,X10),X7)
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( in(esk7_4(X7,X8,X9,X10),X8)
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( X10 = ordered_pair(esk6_4(X7,X8,X9,X10),esk7_4(X7,X8,X9,X10))
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( ~ in(X13,X7)
| ~ in(X14,X8)
| X10 != ordered_pair(X13,X14)
| in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( ~ in(esk8_3(X7,X8,X9),X9)
| ~ in(X16,X7)
| ~ in(X17,X8)
| esk8_3(X7,X8,X9) != ordered_pair(X16,X17)
| X9 = cartesian_product2(X7,X8) )
& ( in(esk9_3(X7,X8,X9),X7)
| in(esk8_3(X7,X8,X9),X9)
| X9 = cartesian_product2(X7,X8) )
& ( in(esk10_3(X7,X8,X9),X8)
| in(esk8_3(X7,X8,X9),X9)
| X9 = cartesian_product2(X7,X8) )
& ( esk8_3(X7,X8,X9) = ordered_pair(esk9_3(X7,X8,X9),esk10_3(X7,X8,X9))
| in(esk8_3(X7,X8,X9),X9)
| X9 = cartesian_product2(X7,X8) ) ),
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)],[d2_zfmisc_1])])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> ( subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))
& subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)) ) ),
inference(assume_negation,[status(cth)],[t118_zfmisc_1]) ).
cnf(c_0_5,plain,
( in(X4,X1)
| X1 != cartesian_product2(X2,X3)
| X4 != ordered_pair(X5,X6)
| ~ in(X6,X3)
| ~ in(X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X4 = ordered_pair(esk6_4(X2,X3,X1,X4),esk7_4(X2,X3,X1,X4))
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_7,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk5_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk5_2(X4,X5),X5)
| subset(X4,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)],[d3_tarski])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( subset(esk1_0,esk2_0)
& ( ~ subset(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk3_0))
| ~ subset(cartesian_product2(esk4_0,esk1_0),cartesian_product2(esk4_0,esk2_0)) ) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_9,plain,
( in(X1,X2)
| X2 != cartesian_product2(X3,X4)
| X5 != cartesian_product2(X6,X7)
| ~ in(esk7_4(X6,X7,X5,X1),X4)
| ~ in(esk6_4(X6,X7,X5,X1),X3)
| ~ in(X1,X5) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6])]) ).
cnf(c_0_10,plain,
( in(esk7_4(X2,X3,X1,X4),X3)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| X2 != cartesian_product2(X3,X4)
| X5 != cartesian_product2(X6,X4)
| ~ in(esk6_4(X6,X4,X5,X1),X3)
| ~ in(X1,X5) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( in(X1,X2)
| X2 != cartesian_product2(esk2_0,X3)
| X4 != cartesian_product2(X5,X3)
| ~ in(esk6_4(X5,X3,X4,X1),esk1_0)
| ~ in(X1,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( in(esk6_4(X2,X3,X1,X4),X2)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,negated_conjecture,
( in(X1,X2)
| X2 != cartesian_product2(X3,esk2_0)
| X4 != cartesian_product2(X5,X6)
| ~ in(esk7_4(X5,X6,X4,X1),esk1_0)
| ~ in(esk6_4(X5,X6,X4,X1),X3)
| ~ in(X1,X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( in(X1,X2)
| X2 != cartesian_product2(esk2_0,X3)
| X4 != cartesian_product2(esk1_0,X3)
| ~ in(X1,X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( in(X1,X2)
| X2 != cartesian_product2(X3,esk2_0)
| X4 != cartesian_product2(X5,esk1_0)
| ~ in(esk6_4(X5,esk1_0,X4,X1),X3)
| ~ in(X1,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_20,negated_conjecture,
( in(X1,cartesian_product2(esk2_0,X2))
| X3 != cartesian_product2(esk1_0,X2)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( in(X1,X2)
| X2 != cartesian_product2(X3,esk2_0)
| X4 != cartesian_product2(X3,esk1_0)
| ~ in(X1,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_22,plain,
( subset(X1,X2)
| ~ in(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( in(X1,cartesian_product2(esk2_0,X2))
| ~ in(X1,cartesian_product2(esk1_0,X2)) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( in(X1,cartesian_product2(X2,esk2_0))
| X3 != cartesian_product2(X2,esk1_0)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( subset(X1,cartesian_product2(esk2_0,X2))
| ~ in(esk5_2(X1,cartesian_product2(esk2_0,X2)),cartesian_product2(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( subset(X1,X2)
| in(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
( in(X1,cartesian_product2(X2,esk2_0))
| ~ in(X1,cartesian_product2(X2,esk1_0)) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ subset(cartesian_product2(esk4_0,esk1_0),cartesian_product2(esk4_0,esk2_0))
| ~ subset(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
subset(cartesian_product2(esk1_0,X1),cartesian_product2(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( subset(X1,cartesian_product2(X2,esk2_0))
| ~ in(esk5_2(X1,cartesian_product2(X2,esk2_0)),cartesian_product2(X2,esk1_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
~ subset(cartesian_product2(esk4_0,esk1_0),cartesian_product2(esk4_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
subset(cartesian_product2(X1,esk1_0),cartesian_product2(X1,esk2_0)),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU166+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n018.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 : Sun Jun 19 23:44:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.015 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 34
% 0.22/1.41 # Proof object clause steps : 27
% 0.22/1.41 # Proof object formula steps : 7
% 0.22/1.41 # Proof object conjectures : 21
% 0.22/1.41 # Proof object clause conjectures : 18
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 9
% 0.22/1.41 # Proof object initial formulas used : 3
% 0.22/1.41 # Proof object generating inferences : 16
% 0.22/1.41 # Proof object simplifying inferences : 5
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 10
% 0.22/1.41 # Removed by relevancy pruning/SinE : 2
% 0.22/1.41 # Initial clauses : 18
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 18
% 0.22/1.41 # Processed clauses : 73
% 0.22/1.41 # ...of these trivial : 2
% 0.22/1.41 # ...subsumed : 5
% 0.22/1.41 # ...remaining for further processing : 66
% 0.22/1.41 # Other redundant clauses eliminated : 1
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 2
% 0.22/1.41 # Generated clauses : 91
% 0.22/1.41 # ...of the previous two non-trivial : 87
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 83
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 8
% 0.22/1.41 # Current number of processed clauses : 64
% 0.22/1.41 # Positive orientable unit clauses : 5
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 3
% 0.22/1.41 # Non-unit-clauses : 56
% 0.22/1.41 # Current number of unprocessed clauses: 32
% 0.22/1.41 # ...number of literals in the above : 147
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 2
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 1001
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 295
% 0.22/1.41 # Non-unit clause-clause subsumptions : 4
% 0.22/1.41 # Unit Clause-clause subsumption calls : 2
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 2
% 0.22/1.41 # BW rewrite match successes : 2
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 2866
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.020 s
% 0.22/1.41 # System time : 0.002 s
% 0.22/1.41 # Total time : 0.022 s
% 0.22/1.41 # Maximum resident set size: 2964 pages
% 0.22/23.40 eprover: CPU time limit exceeded, terminating
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------