TSTP Solution File: SEU430+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU430+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:20:07 EDT 2022
% Result : Theorem 1.17s 2.36s
% Output : CNFRefutation 1.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 61 ( 39 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 65 ( 27 ~; 21 |; 10 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 1 sgn 16 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t30_relset_2,conjecture,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t30_relset_2) ).
fof(redefinition_k5_setfam_1,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> k5_setfam_1(X1,X2) = k3_tarski(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+8.ax',redefinition_k5_setfam_1) ).
fof(t91_orders_1,axiom,
! [X1] :
( ~ ( ? [X2] :
( X2 != k1_xboole_0
& r2_hidden(X2,X1) )
& k3_tarski(X1) = k1_xboole_0 )
& ~ ( k3_tarski(X1) != k1_xboole_0
& ! [X2] :
~ ( X2 != k1_xboole_0
& r2_hidden(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+59.ax',t91_orders_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
inference(assume_negation,[status(cth)],[t30_relset_2]) ).
fof(c_0_4,plain,
! [X3,X4] :
( ~ m1_subset_1(X4,k1_zfmisc_1(k1_zfmisc_1(X3)))
| k5_setfam_1(X3,X4) = k3_tarski(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])]) ).
fof(c_0_5,negated_conjecture,
! [X7] :
( m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
& ( r2_hidden(esk3_0,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 )
& ( esk3_0 != k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 )
& ( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
| ~ r2_hidden(X7,esk2_0)
| X7 = k1_xboole_0 ) ),
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)],[c_0_3])])])])])])]) ).
fof(c_0_6,plain,
! [X3,X4,X3] :
( ( X4 = k1_xboole_0
| ~ r2_hidden(X4,X3)
| k3_tarski(X3) != k1_xboole_0 )
& ( esk49_1(X3) != k1_xboole_0
| k3_tarski(X3) = k1_xboole_0 )
& ( r2_hidden(esk49_1(X3),X3)
| k3_tarski(X3) = k1_xboole_0 ) ),
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)],[t91_orders_1])])])])])])]) ).
cnf(c_0_7,plain,
( k5_setfam_1(X1,X2) = k3_tarski(X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( X1 = k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
| ~ r2_hidden(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( k3_tarski(X1) = k1_xboole_0
| r2_hidden(esk49_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( k3_tarski(X1) = k1_xboole_0
| esk49_1(X1) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( r2_hidden(esk3_0,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
k5_setfam_1(esk1_0,esk2_0) = k3_tarski(esk2_0),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
| k3_tarski(esk2_0) = k1_xboole_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| esk3_0 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( r2_hidden(esk3_0,esk2_0)
| k3_tarski(esk2_0) != k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
k3_tarski(esk2_0) = k1_xboole_0,
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( k3_tarski(esk2_0) != k1_xboole_0
| esk3_0 != k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_19,plain,
( X2 = k1_xboole_0
| k3_tarski(X1) != k1_xboole_0
| ~ r2_hidden(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
r2_hidden(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
esk3_0 != k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU430+3 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.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 : Mon Jun 20 08:47:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.17/2.36 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 1.17/2.36 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 1.17/2.36 # Preprocessing time : 0.721 s
% 1.17/2.36
% 1.17/2.36 # Proof found!
% 1.17/2.36 # SZS status Theorem
% 1.17/2.36 # SZS output start CNFRefutation
% See solution above
% 1.17/2.36 # Proof object total steps : 23
% 1.17/2.36 # Proof object clause steps : 16
% 1.17/2.36 # Proof object formula steps : 7
% 1.17/2.36 # Proof object conjectures : 15
% 1.17/2.36 # Proof object clause conjectures : 12
% 1.17/2.36 # Proof object formula conjectures : 3
% 1.17/2.36 # Proof object initial clauses used : 8
% 1.17/2.36 # Proof object initial formulas used : 3
% 1.17/2.36 # Proof object generating inferences : 4
% 1.17/2.36 # Proof object simplifying inferences : 10
% 1.17/2.36 # Training examples: 0 positive, 0 negative
% 1.17/2.36 # Parsed axioms : 19101
% 1.17/2.36 # Removed by relevancy pruning/SinE : 18781
% 1.17/2.36 # Initial clauses : 707
% 1.17/2.36 # Removed in clause preprocessing : 10
% 1.17/2.36 # Initial clauses in saturation : 697
% 1.17/2.36 # Processed clauses : 799
% 1.17/2.36 # ...of these trivial : 5
% 1.17/2.36 # ...subsumed : 56
% 1.17/2.36 # ...remaining for further processing : 738
% 1.17/2.36 # Other redundant clauses eliminated : 10
% 1.17/2.36 # Clauses deleted for lack of memory : 0
% 1.17/2.36 # Backward-subsumed : 3
% 1.17/2.36 # Backward-rewritten : 40
% 1.17/2.36 # Generated clauses : 5751
% 1.17/2.36 # ...of the previous two non-trivial : 5583
% 1.17/2.36 # Contextual simplify-reflections : 110
% 1.17/2.36 # Paramodulations : 5733
% 1.17/2.36 # Factorizations : 2
% 1.17/2.36 # Equation resolutions : 17
% 1.17/2.36 # Current number of processed clauses : 689
% 1.17/2.36 # Positive orientable unit clauses : 70
% 1.17/2.36 # Positive unorientable unit clauses: 0
% 1.17/2.36 # Negative unit clauses : 16
% 1.17/2.36 # Non-unit-clauses : 603
% 1.17/2.36 # Current number of unprocessed clauses: 5090
% 1.17/2.36 # ...number of literals in the above : 24369
% 1.17/2.36 # Current number of archived formulas : 0
% 1.17/2.36 # Current number of archived clauses : 44
% 1.17/2.36 # Clause-clause subsumption calls (NU) : 247150
% 1.17/2.36 # Rec. Clause-clause subsumption calls : 23767
% 1.17/2.36 # Non-unit clause-clause subsumptions : 153
% 1.17/2.36 # Unit Clause-clause subsumption calls : 6335
% 1.17/2.36 # Rewrite failures with RHS unbound : 0
% 1.17/2.36 # BW rewrite match attempts : 10
% 1.17/2.36 # BW rewrite match successes : 9
% 1.17/2.36 # Condensation attempts : 0
% 1.17/2.36 # Condensation successes : 0
% 1.17/2.36 # Termbank termtop insertions : 724071
% 1.17/2.36
% 1.17/2.36 # -------------------------------------------------
% 1.17/2.36 # User time : 0.842 s
% 1.17/2.36 # System time : 0.035 s
% 1.17/2.36 # Total time : 0.877 s
% 1.17/2.36 # Maximum resident set size: 52828 pages
%------------------------------------------------------------------------------