%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU420+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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:57 EDT 2022
% Result : Theorem 1.33s 25.51s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 16 unt; 0 def)
% Number of atoms : 60 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 23 ~; 17 |; 3 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 2 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_relset_2,conjecture,
! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k9_relat_1(k3_xboole_0(X2,X3),k3_pua2mss1(X1)),k3_xboole_0(k9_relat_1(X2,k3_pua2mss1(X1)),k9_relat_1(X3,k3_pua2mss1(X1)))) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t13_relset_2) ).
fof(d2_pua2mss1,axiom,
! [X1] : k3_pua2mss1(X1) = k8_eqrel_1(X1,k6_partfun1(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+441.ax',d2_pua2mss1) ).
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/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t19_xboole_1) ).
fof(t157_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> ( r1_tarski(X2,X3)
=> r1_tarski(k9_relat_1(X2,X1),k9_relat_1(X3,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t157_relat_1) ).
fof(t3_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ( r1_tarski(X1,X2)
=> v1_relat_1(X1) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t17_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k3_xboole_0) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k9_relat_1(k3_xboole_0(X2,X3),k3_pua2mss1(X1)),k3_xboole_0(k9_relat_1(X2,k3_pua2mss1(X1)),k9_relat_1(X3,k3_pua2mss1(X1)))) ) ),
inference(assume_negation,[status(cth)],[t13_relset_2]) ).
fof(c_0_8,negated_conjecture,
( v1_relat_1(esk2_0)
& v1_relat_1(esk3_0)
& ~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k3_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_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_7])])])])]) ).
fof(c_0_9,plain,
! [X2] : k3_pua2mss1(X2) = k8_eqrel_1(X2,k6_partfun1(X2)),
inference(variable_rename,[status(thm)],[d2_pua2mss1]) ).
cnf(c_0_10,negated_conjecture,
~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k3_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
k3_pua2mss1(X1) = k8_eqrel_1(X1,k6_partfun1(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,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])]) ).
fof(c_0_13,plain,
! [X4,X5,X6] :
( ~ v1_relat_1(X5)
| ~ v1_relat_1(X6)
| ~ r1_tarski(X5,X6)
| r1_tarski(k9_relat_1(X5,X4),k9_relat_1(X6,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)],[t157_relat_1])])])])]) ).
fof(c_0_14,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_15,plain,
! [X3,X4] : r1_tarski(k3_xboole_0(X3,X4),X3),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_16,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_17,negated_conjecture,
~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k3_xboole_0(k9_relat_1(esk2_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k9_relat_1(esk3_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11]) ).
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_12]) ).
cnf(c_0_19,plain,
( r1_tarski(k9_relat_1(X1,X2),k9_relat_1(X3,X2))
| ~ r1_tarski(X1,X3)
| ~ v1_relat_1(X3)
| ~ v1_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( v1_relat_1(X1)
| ~ r1_tarski(X1,X2)
| ~ v1_relat_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
r1_tarski(k3_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k9_relat_1(esk3_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))))
| ~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k9_relat_1(esk2_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0)))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( r1_tarski(k9_relat_1(X1,X2),k9_relat_1(X3,X2))
| ~ v1_relat_1(X3)
| ~ r1_tarski(X1,X3) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
v1_relat_1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
r1_tarski(k3_xboole_0(X1,X2),X2),
inference(pm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k9_relat_1(esk2_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_28,negated_conjecture,
v1_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_28]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU420+3 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n011.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 : Mon Jun 20 12:21:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.33/24.40 eprover: CPU time limit exceeded, terminating
% 1.33/24.40 eprover: CPU time limit exceeded, terminating
% 1.33/24.40 eprover: CPU time limit exceeded, terminating
% 1.33/24.40 eprover: CPU time limit exceeded, terminating
% 1.33/25.51 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 1.33/25.51
% 1.33/25.51 # Failure: Resource limit exceeded (time)
% 1.33/25.51 # OLD status Res
% 1.33/25.51 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 1.33/25.51 # Preprocessing time : 0.725 s
% 1.33/25.51 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 1.33/25.51 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 1.33/25.51 # Preprocessing time : 0.595 s
% 1.33/25.51
% 1.33/25.51 # Proof found!
% 1.33/25.51 # SZS status Theorem
% 1.33/25.51 # SZS output start CNFRefutation
% See solution above
% 1.33/25.51 # Proof object total steps : 30
% 1.33/25.51 # Proof object clause steps : 15
% 1.33/25.51 # Proof object formula steps : 15
% 1.33/25.51 # Proof object conjectures : 10
% 1.33/25.51 # Proof object clause conjectures : 7
% 1.33/25.51 # Proof object formula conjectures : 3
% 1.33/25.51 # Proof object initial clauses used : 9
% 1.33/25.51 # Proof object initial formulas used : 7
% 1.33/25.51 # Proof object generating inferences : 4
% 1.33/25.51 # Proof object simplifying inferences : 10
% 1.33/25.51 # Training examples: 0 positive, 0 negative
% 1.33/25.51 # Parsed axioms : 19081
% 1.33/25.51 # Removed by relevancy pruning/SinE : 18959
% 1.33/25.51 # Initial clauses : 184
% 1.33/25.51 # Removed in clause preprocessing : 5
% 1.33/25.51 # Initial clauses in saturation : 179
% 1.33/25.51 # Processed clauses : 207
% 1.33/25.51 # ...of these trivial : 2
% 1.33/25.51 # ...subsumed : 21
% 1.33/25.51 # ...remaining for further processing : 184
% 1.33/25.51 # Other redundant clauses eliminated : 15
% 1.33/25.51 # Clauses deleted for lack of memory : 0
% 1.33/25.51 # Backward-subsumed : 0
% 1.33/25.51 # Backward-rewritten : 3
% 1.33/25.51 # Generated clauses : 1432
% 1.33/25.51 # ...of the previous two non-trivial : 1283
% 1.33/25.51 # Contextual simplify-reflections : 9
% 1.33/25.51 # Paramodulations : 1406
% 1.33/25.51 # Factorizations : 4
% 1.33/25.51 # Equation resolutions : 22
% 1.33/25.51 # Current number of processed clauses : 179
% 1.33/25.51 # Positive orientable unit clauses : 29
% 1.33/25.51 # Positive unorientable unit clauses: 1
% 1.33/25.51 # Negative unit clauses : 5
% 1.33/25.51 # Non-unit-clauses : 144
% 1.33/25.51 # Current number of unprocessed clauses: 1184
% 1.33/25.51 # ...number of literals in the above : 4127
% 1.33/25.51 # Current number of archived formulas : 0
% 1.33/25.51 # Current number of archived clauses : 4
% 1.33/25.51 # Clause-clause subsumption calls (NU) : 4081
% 1.33/25.51 # Rec. Clause-clause subsumption calls : 1247
% 1.33/25.51 # Non-unit clause-clause subsumptions : 22
% 1.33/25.51 # Unit Clause-clause subsumption calls : 90
% 1.33/25.51 # Rewrite failures with RHS unbound : 0
% 1.33/25.51 # BW rewrite match attempts : 28
% 1.33/25.51 # BW rewrite match successes : 19
% 1.33/25.51 # Condensation attempts : 0
% 1.33/25.51 # Condensation successes : 0
% 1.33/25.51 # Termbank termtop insertions : 574781
% 1.33/25.51
% 1.33/25.51 # -------------------------------------------------
% 1.33/25.51 # User time : 0.598 s
% 1.33/25.51 # System time : 0.020 s
% 1.33/25.51 # Total time : 0.618 s
% 1.33/25.51 # Maximum resident set size: 46828 pages
%------------------------------------------------------------------------------