TSTP Solution File: SEU418+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU418+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:19:55 EDT 2022
% Result : Theorem 0.49s 1.66s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 25 unt; 0 def)
% Number of atoms : 81 ( 11 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 71 ( 31 ~; 23 |; 4 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 70 ( 3 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_relset_2,conjecture,
! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k5_relat_1(k3_xboole_0(X1,X2),X3),k3_xboole_0(k5_relat_1(X1,X3),k5_relat_1(X2,X3))) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_relset_2) ).
fof(t48_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t48_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k3_xboole_0) ).
fof(t19_xboole_1,axiom,
! [X1,X2,X3] :
( ( r1_tarski(X1,X2)
& r1_tarski(X1,X3) )
=> r1_tarski(X1,k3_xboole_0(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t19_xboole_1) ).
fof(t49_relat_1,axiom,
! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> ( r1_tarski(X1,X2)
=> r1_tarski(k5_relat_1(X1,X3),k5_relat_1(X2,X3)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+10.ax',t49_relat_1) ).
fof(t3_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ( r1_tarski(X1,X2)
=> v1_relat_1(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+10.ax',t3_relat_1) ).
fof(t17_xboole_1,axiom,
! [X1,X2] : r1_tarski(k3_xboole_0(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t17_xboole_1) ).
fof(t47_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k3_xboole_0(X1,X2)) = k4_xboole_0(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t47_xboole_1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k5_relat_1(k3_xboole_0(X1,X2),X3),k3_xboole_0(k5_relat_1(X1,X3),k5_relat_1(X2,X3))) ) ) ),
inference(assume_negation,[status(cth)],[t8_relset_2]) ).
fof(c_0_9,negated_conjecture,
( v1_relat_1(esk1_0)
& v1_relat_1(esk2_0)
& v1_relat_1(esk3_0)
& ~ r1_tarski(k5_relat_1(k3_xboole_0(esk1_0,esk2_0),esk3_0),k3_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_10,plain,
! [X3,X4] : k4_xboole_0(X3,k4_xboole_0(X3,X4)) = k3_xboole_0(X3,X4),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_11,plain,
! [X3,X4] : k3_xboole_0(X3,X4) = k3_xboole_0(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_12,negated_conjecture,
~ r1_tarski(k5_relat_1(k3_xboole_0(esk1_0,esk2_0),esk3_0),k3_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( ~ r1_tarski(X4,X5)
| ~ r1_tarski(X4,X6)
| r1_tarski(X4,k3_xboole_0(X5,X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])]) ).
cnf(c_0_16,negated_conjecture,
~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k4_xboole_0(k5_relat_1(esk1_0,esk3_0),k4_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k4_xboole_0(X2,k4_xboole_0(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13]),c_0_13]) ).
cnf(c_0_18,plain,
( r1_tarski(X1,k3_xboole_0(X2,X3))
| ~ r1_tarski(X1,X3)
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X4,X5,X6] :
( ~ v1_relat_1(X4)
| ~ v1_relat_1(X5)
| ~ v1_relat_1(X6)
| ~ r1_tarski(X4,X5)
| r1_tarski(k5_relat_1(X4,X6),k5_relat_1(X5,X6)) ),
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)],[t49_relat_1])])])])]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ v1_relat_1(X4)
| ~ r1_tarski(X3,X4)
| v1_relat_1(X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_relat_1])]) ).
fof(c_0_21,plain,
! [X3,X4] : r1_tarski(k3_xboole_0(X3,X4),X3),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_22,plain,
! [X3,X4] : k4_xboole_0(X3,k3_xboole_0(X3,X4)) = k4_xboole_0(X3,X4),
inference(variable_rename,[status(thm)],[t47_xboole_1]) ).
cnf(c_0_23,negated_conjecture,
~ r1_tarski(k5_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk1_0)),esk3_0),k4_xboole_0(k5_relat_1(esk2_0,esk3_0),k4_xboole_0(k5_relat_1(esk2_0,esk3_0),k5_relat_1(esk1_0,esk3_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_24,plain,
( r1_tarski(X1,k4_xboole_0(X2,k4_xboole_0(X2,X3)))
| ~ r1_tarski(X1,X3)
| ~ r1_tarski(X1,X2) ),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_25,plain,
( r1_tarski(k5_relat_1(X1,X2),k5_relat_1(X3,X2))
| ~ r1_tarski(X1,X3)
| ~ v1_relat_1(X2)
| ~ v1_relat_1(X3)
| ~ v1_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( v1_relat_1(X1)
| ~ r1_tarski(X1,X2)
| ~ v1_relat_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
r1_tarski(k3_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
k4_xboole_0(X1,k3_xboole_0(X1,X2)) = k4_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ r1_tarski(k5_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk1_0)),esk3_0),k5_relat_1(esk1_0,esk3_0))
| ~ r1_tarski(k5_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk1_0)),esk3_0),k5_relat_1(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( r1_tarski(k5_relat_1(X1,X2),k5_relat_1(X3,X2))
| ~ v1_relat_1(X3)
| ~ v1_relat_1(X2)
| ~ r1_tarski(X1,X3) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
v1_relat_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
v1_relat_1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,plain,
r1_tarski(k4_xboole_0(X1,k4_xboole_0(X1,X2)),X1),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_34,plain,
k4_xboole_0(X1,k4_xboole_0(X1,k4_xboole_0(X1,X2))) = k4_xboole_0(X1,X2),
inference(rw,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_35,negated_conjecture,
( ~ r1_tarski(k5_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk1_0)),esk3_0),k5_relat_1(esk2_0,esk3_0))
| ~ r1_tarski(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk1_0)),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
v1_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_37,plain,
r1_tarski(k4_xboole_0(X1,X2),X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
~ r1_tarski(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk1_0)),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_36]),c_0_32]),c_0_33])]) ).
cnf(c_0_39,plain,
r1_tarski(k4_xboole_0(X1,k4_xboole_0(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_37,c_0_17]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU418+2 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.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 21:00:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.49/1.66 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.49/1.66 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.49/1.66 # Preprocessing time : 0.168 s
% 0.49/1.66
% 0.49/1.66 # Proof found!
% 0.49/1.66 # SZS status Theorem
% 0.49/1.66 # SZS output start CNFRefutation
% See solution above
% 0.49/1.66 # Proof object total steps : 41
% 0.49/1.66 # Proof object clause steps : 24
% 0.49/1.66 # Proof object formula steps : 17
% 0.49/1.66 # Proof object conjectures : 13
% 0.49/1.66 # Proof object clause conjectures : 10
% 0.49/1.66 # Proof object formula conjectures : 3
% 0.49/1.66 # Proof object initial clauses used : 11
% 0.49/1.66 # Proof object initial formulas used : 8
% 0.49/1.66 # Proof object generating inferences : 5
% 0.49/1.66 # Proof object simplifying inferences : 19
% 0.49/1.66 # Training examples: 0 positive, 0 negative
% 0.49/1.66 # Parsed axioms : 4476
% 0.49/1.66 # Removed by relevancy pruning/SinE : 4375
% 0.49/1.66 # Initial clauses : 157
% 0.49/1.66 # Removed in clause preprocessing : 5
% 0.49/1.66 # Initial clauses in saturation : 152
% 0.49/1.66 # Processed clauses : 432
% 0.49/1.66 # ...of these trivial : 37
% 0.49/1.66 # ...subsumed : 156
% 0.49/1.66 # ...remaining for further processing : 239
% 0.49/1.66 # Other redundant clauses eliminated : 31
% 0.49/1.66 # Clauses deleted for lack of memory : 0
% 0.49/1.66 # Backward-subsumed : 3
% 0.49/1.66 # Backward-rewritten : 18
% 0.49/1.66 # Generated clauses : 5247
% 0.49/1.66 # ...of the previous two non-trivial : 4282
% 0.49/1.66 # Contextual simplify-reflections : 41
% 0.49/1.66 # Paramodulations : 5204
% 0.49/1.66 # Factorizations : 6
% 0.49/1.66 # Equation resolutions : 37
% 0.49/1.66 # Current number of processed clauses : 216
% 0.49/1.66 # Positive orientable unit clauses : 42
% 0.49/1.66 # Positive unorientable unit clauses: 5
% 0.49/1.66 # Negative unit clauses : 13
% 0.49/1.66 # Non-unit-clauses : 156
% 0.49/1.66 # Current number of unprocessed clauses: 3509
% 0.49/1.66 # ...number of literals in the above : 9289
% 0.49/1.66 # Current number of archived formulas : 0
% 0.49/1.66 # Current number of archived clauses : 22
% 0.49/1.66 # Clause-clause subsumption calls (NU) : 5426
% 0.49/1.66 # Rec. Clause-clause subsumption calls : 1910
% 0.49/1.66 # Non-unit clause-clause subsumptions : 121
% 0.49/1.66 # Unit Clause-clause subsumption calls : 717
% 0.49/1.66 # Rewrite failures with RHS unbound : 0
% 0.49/1.66 # BW rewrite match attempts : 448
% 0.49/1.66 # BW rewrite match successes : 50
% 0.49/1.66 # Condensation attempts : 0
% 0.49/1.66 # Condensation successes : 0
% 0.49/1.66 # Termbank termtop insertions : 188029
% 0.49/1.66
% 0.49/1.66 # -------------------------------------------------
% 0.49/1.66 # User time : 0.256 s
% 0.49/1.66 # System time : 0.014 s
% 0.49/1.66 # Total time : 0.270 s
% 0.49/1.66 # Maximum resident set size: 14216 pages
%------------------------------------------------------------------------------