TSTP Solution File: SEU129+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU129+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:16:59 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 84 ( 12 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 86 ( 33 ~; 38 |; 9 &)
% ( 3 <=>; 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 : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 71 ( 11 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t26_xboole_1,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t26_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
inference(assume_negation,[status(cth)],[t26_xboole_1]) ).
fof(c_0_5,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk4_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_6,negated_conjecture,
( subset(esk1_0,esk2_0)
& ~ subset(set_intersection2(esk1_0,esk3_0),set_intersection2(esk2_0,esk3_0)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,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(esk5_3(X5,X6,X7),X7)
| ~ in(esk5_3(X5,X6,X7),X5)
| ~ in(esk5_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X5)
| in(esk5_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X6)
| in(esk5_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])])])])])])]) ).
cnf(c_0_8,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( subset(X1,esk2_0)
| ~ in(esk4_2(X1,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( subset(set_intersection2(X1,X2),X3)
| in(esk4_2(set_intersection2(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_17,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_18,negated_conjecture,
subset(set_intersection2(X1,esk1_0),esk2_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
subset(set_intersection2(esk1_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,set_intersection2(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_21]) ).
cnf(c_0_24,plain,
( subset(X1,set_intersection2(X2,X3))
| ~ in(esk4_2(X1,set_intersection2(X2,X3)),X3)
| ~ in(esk4_2(X1,set_intersection2(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( subset(set_intersection2(esk1_0,X1),X2)
| in(esk4_2(set_intersection2(esk1_0,X1),X2),esk2_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( subset(set_intersection2(esk1_0,X1),set_intersection2(X2,esk2_0))
| ~ in(esk4_2(set_intersection2(esk1_0,X1),set_intersection2(X2,esk2_0)),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
subset(set_intersection2(esk1_0,X1),set_intersection2(X1,esk2_0)),
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
cnf(c_0_28,negated_conjecture,
~ subset(set_intersection2(esk1_0,esk3_0),set_intersection2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
subset(set_intersection2(esk1_0,X1),set_intersection2(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU129+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 12:31:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.015 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 31
% 0.24/1.42 # Proof object clause steps : 22
% 0.24/1.42 # Proof object formula steps : 9
% 0.24/1.42 # Proof object conjectures : 15
% 0.24/1.42 # Proof object clause conjectures : 12
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 8
% 0.24/1.42 # Proof object initial formulas used : 4
% 0.24/1.42 # Proof object generating inferences : 13
% 0.24/1.42 # Proof object simplifying inferences : 2
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 16
% 0.24/1.42 # Removed by relevancy pruning/SinE : 5
% 0.24/1.42 # Initial clauses : 19
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 19
% 0.24/1.42 # Processed clauses : 850
% 0.24/1.42 # ...of these trivial : 26
% 0.24/1.42 # ...subsumed : 579
% 0.24/1.42 # ...remaining for further processing : 245
% 0.24/1.42 # Other redundant clauses eliminated : 17
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 14
% 0.24/1.42 # Backward-rewritten : 2
% 0.24/1.42 # Generated clauses : 2907
% 0.24/1.42 # ...of the previous two non-trivial : 2481
% 0.24/1.42 # Contextual simplify-reflections : 241
% 0.24/1.42 # Paramodulations : 2839
% 0.24/1.42 # Factorizations : 34
% 0.24/1.42 # Equation resolutions : 34
% 0.24/1.42 # Current number of processed clauses : 229
% 0.24/1.42 # Positive orientable unit clauses : 22
% 0.24/1.42 # Positive unorientable unit clauses: 1
% 0.24/1.42 # Negative unit clauses : 14
% 0.24/1.42 # Non-unit-clauses : 192
% 0.24/1.42 # Current number of unprocessed clauses: 1371
% 0.24/1.42 # ...number of literals in the above : 4235
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 16
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 14361
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 12081
% 0.24/1.42 # Non-unit clause-clause subsumptions : 682
% 0.24/1.42 # Unit Clause-clause subsumption calls : 389
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 29
% 0.24/1.42 # BW rewrite match successes : 8
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 30623
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.086 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.088 s
% 0.24/1.42 # Maximum resident set size: 4364 pages
%------------------------------------------------------------------------------