TSTP Solution File: SEU140+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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:04 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 13 unt; 0 def)
% Number of atoms : 60 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 45 ( 19 ~; 15 |; 5 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 2 sgn 26 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d7_xboole_0) ).
fof(t63_xboole_1,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t63_xboole_1) ).
fof(t3_xboole_1,axiom,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_xboole_1) ).
fof(t26_xboole_1,axiom,
! [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(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_7,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_8,plain,
empty(esk4_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_9,plain,
! [X3,X4,X3,X4] :
( ( ~ disjoint(X3,X4)
| set_intersection2(X3,X4) = empty_set )
& ( set_intersection2(X3,X4) != empty_set
| disjoint(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])])]) ).
cnf(c_0_10,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
empty(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
inference(assume_negation,[status(cth)],[t63_xboole_1]) ).
cnf(c_0_13,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
empty_set = esk4_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,negated_conjecture,
( subset(esk1_0,esk2_0)
& disjoint(esk2_0,esk3_0)
& ~ disjoint(esk1_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_16,plain,
! [X2] :
( ~ subset(X2,empty_set)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_xboole_1])]) ).
fof(c_0_17,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| subset(set_intersection2(X4,X6),set_intersection2(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t26_xboole_1])])])]) ).
cnf(c_0_18,plain,
( set_intersection2(X1,X2) = esk4_0
| ~ disjoint(X1,X2) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
disjoint(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
set_intersection2(esk2_0,esk3_0) = esk4_0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_24,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_25,plain,
( X1 = esk4_0
| ~ subset(X1,esk4_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_14]),c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( subset(set_intersection2(X1,esk3_0),esk4_0)
| ~ subset(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ disjoint(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != esk4_0 ),
inference(rw,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_29,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( set_intersection2(X1,esk3_0) = esk4_0
| ~ subset(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,negated_conjecture,
set_intersection2(esk3_0,esk1_0) != esk4_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 05:09:13 EDT 2022
% 0.13/0.35 % 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 : 34
% 0.24/1.42 # Proof object clause steps : 19
% 0.24/1.42 # Proof object formula steps : 15
% 0.24/1.42 # Proof object conjectures : 11
% 0.24/1.42 # Proof object clause conjectures : 8
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 10
% 0.24/1.42 # Proof object initial formulas used : 7
% 0.24/1.42 # Proof object generating inferences : 6
% 0.24/1.42 # Proof object simplifying inferences : 7
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 18
% 0.24/1.42 # Removed by relevancy pruning/SinE : 4
% 0.24/1.42 # Initial clauses : 17
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 17
% 0.24/1.42 # Processed clauses : 64
% 0.24/1.42 # ...of these trivial : 2
% 0.24/1.42 # ...subsumed : 14
% 0.24/1.42 # ...remaining for further processing : 48
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 6
% 0.24/1.42 # Generated clauses : 136
% 0.24/1.42 # ...of the previous two non-trivial : 90
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 136
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 42
% 0.24/1.42 # Positive orientable unit clauses : 10
% 0.24/1.42 # Positive unorientable unit clauses: 1
% 0.24/1.42 # Negative unit clauses : 3
% 0.24/1.42 # Non-unit-clauses : 28
% 0.24/1.42 # Current number of unprocessed clauses: 37
% 0.24/1.42 # ...number of literals in the above : 74
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 6
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 187
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 187
% 0.24/1.42 # Non-unit clause-clause subsumptions : 13
% 0.24/1.42 # Unit Clause-clause subsumption calls : 4
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 9
% 0.24/1.42 # BW rewrite match successes : 7
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 1804
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.016 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.018 s
% 0.24/1.42 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------