TSTP Solution File: RNG093+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG093+2 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 20:26:53 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 33 ( 6 unt; 0 def)
% Number of atoms : 130 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 153 ( 56 ~; 52 |; 29 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 1 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aSet0(sdtasasdt0(xI,xJ))
& ! [X1] :
( aElementOf0(X1,sdtasasdt0(xI,xJ))
<=> ( aElementOf0(X1,xI)
& aElementOf0(X1,xJ) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,sdtasasdt0(xI,xJ))
=> ( ! [X2] :
( aElementOf0(X2,sdtasasdt0(xI,xJ))
=> aElementOf0(sdtpldt0(X1,X2),sdtasasdt0(xI,xJ)) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),sdtasasdt0(xI,xJ)) ) ) )
| aIdeal0(sdtasasdt0(xI,xJ)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__1150,hypothesis,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& aSet0(xJ)
& ! [X1] :
( aElementOf0(X1,xJ)
=> ( ! [X2] :
( aElementOf0(X2,xJ)
=> aElementOf0(sdtpldt0(X1,X2),xJ) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xJ) ) ) )
& aIdeal0(xJ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1150) ).
fof(c_0_2,negated_conjecture,
~ ( ( aSet0(sdtasasdt0(xI,xJ))
& ! [X1] :
( aElementOf0(X1,sdtasasdt0(xI,xJ))
<=> ( aElementOf0(X1,xI)
& aElementOf0(X1,xJ) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,sdtasasdt0(xI,xJ))
=> ( ! [X2] :
( aElementOf0(X2,sdtasasdt0(xI,xJ))
=> aElementOf0(sdtpldt0(X1,X2),sdtasasdt0(xI,xJ)) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),sdtasasdt0(xI,xJ)) ) ) )
| aIdeal0(sdtasasdt0(xI,xJ)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,negated_conjecture,
! [X3,X3] :
( aSet0(sdtasasdt0(xI,xJ))
& ( aElementOf0(X3,xI)
| ~ aElementOf0(X3,sdtasasdt0(xI,xJ)) )
& ( aElementOf0(X3,xJ)
| ~ aElementOf0(X3,sdtasasdt0(xI,xJ)) )
& ( ~ aElementOf0(X3,xI)
| ~ aElementOf0(X3,xJ)
| aElementOf0(X3,sdtasasdt0(xI,xJ)) )
& aElementOf0(esk1_0,sdtasasdt0(xI,xJ))
& ( aElement0(esk3_0)
| aElementOf0(esk2_0,sdtasasdt0(xI,xJ)) )
& ( ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),sdtasasdt0(xI,xJ))
| aElementOf0(esk2_0,sdtasasdt0(xI,xJ)) )
& ( aElement0(esk3_0)
| ~ aElementOf0(sdtpldt0(esk1_0,esk2_0),sdtasasdt0(xI,xJ)) )
& ( ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),sdtasasdt0(xI,xJ))
| ~ aElementOf0(sdtpldt0(esk1_0,esk2_0),sdtasasdt0(xI,xJ)) )
& ~ aIdeal0(sdtasasdt0(xI,xJ)) ),
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_2])])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ aElementOf0(sdtpldt0(esk1_0,esk2_0),sdtasasdt0(xI,xJ))
| ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),sdtasasdt0(xI,xJ)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( aElementOf0(X1,sdtasasdt0(xI,xJ))
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,hypothesis,
! [X3,X4,X5,X6,X7,X8] :
( aSet0(xI)
& ( ~ aElementOf0(X4,xI)
| aElementOf0(sdtpldt0(X3,X4),xI)
| ~ aElementOf0(X3,xI) )
& ( ~ aElement0(X5)
| aElementOf0(sdtasdt0(X5,X3),xI)
| ~ aElementOf0(X3,xI) )
& aIdeal0(xI)
& aSet0(xJ)
& ( ~ aElementOf0(X7,xJ)
| aElementOf0(sdtpldt0(X6,X7),xJ)
| ~ aElementOf0(X6,xJ) )
& ( ~ aElement0(X8)
| aElementOf0(sdtasdt0(X8,X6),xJ)
| ~ aElementOf0(X6,xJ) )
& aIdeal0(xJ) ),
inference(distribute,[status(thm)],[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)],[m__1150])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( aElementOf0(X1,xI)
| ~ aElementOf0(X1,sdtasasdt0(xI,xJ)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
aElementOf0(esk1_0,sdtasasdt0(xI,xJ)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),sdtasasdt0(xI,xJ))
| ~ aElementOf0(sdtpldt0(esk1_0,esk2_0),xI)
| ~ aElementOf0(sdtpldt0(esk1_0,esk2_0),xJ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_10,hypothesis,
( aElementOf0(sdtpldt0(X1,X2),xI)
| ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xI) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
aElementOf0(esk1_0,xI),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( aElementOf0(X1,xJ)
| ~ aElementOf0(X1,sdtasasdt0(xI,xJ)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( aElementOf0(esk2_0,sdtasasdt0(xI,xJ))
| ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),sdtasasdt0(xI,xJ)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),sdtasasdt0(xI,xJ))
| ~ aElementOf0(sdtpldt0(esk1_0,esk2_0),xJ)
| ~ aElementOf0(esk2_0,xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,hypothesis,
( aElementOf0(sdtpldt0(X1,X2),xJ)
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X2,xJ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
aElementOf0(esk1_0,xJ),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( aElementOf0(esk2_0,sdtasasdt0(xI,xJ))
| ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),xI)
| ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),xJ) ),
inference(spm,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( aElement0(esk3_0)
| ~ aElementOf0(sdtpldt0(esk1_0,esk2_0),sdtasasdt0(xI,xJ)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_19,negated_conjecture,
( aElementOf0(esk2_0,sdtasasdt0(xI,xJ))
| aElement0(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,hypothesis,
( ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),sdtasasdt0(xI,xJ))
| ~ aElementOf0(esk2_0,xI)
| ~ aElementOf0(esk2_0,xJ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
( aElementOf0(esk2_0,xI)
| ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),xI)
| ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),xJ) ),
inference(spm,[status(thm)],[c_0_7,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( aElement0(esk3_0)
| ~ aElementOf0(sdtpldt0(esk1_0,esk2_0),xI)
| ~ aElementOf0(sdtpldt0(esk1_0,esk2_0),xJ) ),
inference(spm,[status(thm)],[c_0_18,c_0_5]) ).
cnf(c_0_23,negated_conjecture,
( aElementOf0(esk2_0,xI)
| aElement0(esk3_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),xI)
| ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),xJ)
| ~ aElementOf0(esk2_0,xJ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_5]),c_0_21]) ).
cnf(c_0_25,hypothesis,
( aElement0(esk3_0)
| ~ aElementOf0(sdtpldt0(esk1_0,esk2_0),xJ) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_10]),c_0_11])]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( aElementOf0(esk2_0,xJ)
| aElement0(esk3_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),xI)
| ~ aElementOf0(sdtasdt0(esk3_0,esk1_0),xJ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_24]) ).
cnf(c_0_28,hypothesis,
( aElementOf0(sdtasdt0(X2,X1),xI)
| ~ aElementOf0(X1,xI)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,hypothesis,
aElement0(esk3_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_16])]),c_0_26]) ).
cnf(c_0_30,hypothesis,
~ aElementOf0(sdtasdt0(esk3_0,esk1_0),xJ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_11]),c_0_29])]) ).
cnf(c_0_31,hypothesis,
( aElementOf0(sdtasdt0(X2,X1),xJ)
| ~ aElementOf0(X1,xJ)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG093+2 : TPTP v8.1.0. Released v4.0.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 May 30 04:40:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.018 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 33
% 0.23/1.41 # Proof object clause steps : 28
% 0.23/1.41 # Proof object formula steps : 5
% 0.23/1.41 # Proof object conjectures : 21
% 0.23/1.41 # Proof object clause conjectures : 18
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 12
% 0.23/1.41 # Proof object initial formulas used : 2
% 0.23/1.41 # Proof object generating inferences : 16
% 0.23/1.41 # Proof object simplifying inferences : 18
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 27
% 0.23/1.41 # Removed by relevancy pruning/SinE : 12
% 0.23/1.41 # Initial clauses : 48
% 0.23/1.41 # Removed in clause preprocessing : 2
% 0.23/1.41 # Initial clauses in saturation : 46
% 0.23/1.41 # Processed clauses : 81
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 4
% 0.23/1.41 # ...remaining for further processing : 77
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 7
% 0.23/1.41 # Backward-rewritten : 11
% 0.23/1.41 # Generated clauses : 146
% 0.23/1.41 # ...of the previous two non-trivial : 138
% 0.23/1.41 # Contextual simplify-reflections : 4
% 0.23/1.41 # Paramodulations : 142
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 4
% 0.23/1.41 # Current number of processed clauses : 59
% 0.23/1.41 # Positive orientable unit clauses : 15
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 42
% 0.23/1.41 # Current number of unprocessed clauses: 94
% 0.23/1.41 # ...number of literals in the above : 413
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 18
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 577
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 326
% 0.23/1.41 # Non-unit clause-clause subsumptions : 13
% 0.23/1.41 # Unit Clause-clause subsumption calls : 147
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 3
% 0.23/1.41 # BW rewrite match successes : 3
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 5831
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.024 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.027 s
% 0.23/1.41 # Maximum resident set size: 3052 pages
%------------------------------------------------------------------------------