%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG112+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 20:26:57 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 78 ( 36 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 92 ( 38 ~; 33 |; 17 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 7 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2228,hypothesis,
? [X1] :
( aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& X1 != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2228) ).
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,xI)
& X1 != sz00
& ! [X2] :
( ( aElementOf0(X2,xI)
& X2 != sz00 )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__2351,hypothesis,
! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ? [X2] :
( aElementOf0(X2,xI)
& X2 != sz00
& ! [X3] :
( ( aElementOf0(X3,xI)
& X3 != sz00 )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2351) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2174) ).
fof(c_0_4,hypothesis,
( aElementOf0(esk1_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& esk1_0 != sz00 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2228])]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xI)
& X1 != sz00
& ! [X2] :
( ( aElementOf0(X2,xI)
& X2 != sz00 )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,hypothesis,
! [X4,X6] :
( ( aElementOf0(esk2_0,xI)
| ~ aElementOf0(X4,xI)
| X4 = sz00 )
& ( esk2_0 != sz00
| ~ aElementOf0(X4,xI)
| X4 = sz00 )
& ( ~ aElementOf0(X6,xI)
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(esk2_0))
| ~ aElementOf0(X4,xI)
| X4 = sz00 ) ),
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)],[inference(fof_simplification,[status(thm)],[m__2351])])])])])])])]) ).
cnf(c_0_7,hypothesis,
aElementOf0(esk1_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_9,negated_conjecture,
! [X3] :
( ( aElementOf0(esk3_1(X3),xI)
| ~ aElementOf0(X3,xI)
| X3 = sz00 )
& ( esk3_1(X3) != sz00
| ~ aElementOf0(X3,xI)
| X3 = sz00 )
& ( iLess0(sbrdtbr0(esk3_1(X3)),sbrdtbr0(X3))
| ~ aElementOf0(X3,xI)
| X3 = sz00 ) ),
inference(distribute,[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)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])])])]) ).
cnf(c_0_10,hypothesis,
( X1 = sz00
| aElementOf0(esk2_0,xI)
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
aElementOf0(esk1_0,xI),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,hypothesis,
esk1_0 != sz00,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,hypothesis,
( X1 = sz00
| ~ aElementOf0(X1,xI)
| esk2_0 != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,hypothesis,
( X1 = sz00
| X2 = sz00
| ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(esk2_0))
| ~ aElementOf0(X2,xI) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( X1 = sz00
| iLess0(sbrdtbr0(esk3_1(X1)),sbrdtbr0(X1))
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
aElementOf0(esk2_0,xI),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_17,hypothesis,
sz00 != esk2_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( esk3_1(esk2_0) = sz00
| X1 = sz00
| ~ aElementOf0(esk3_1(esk2_0),xI)
| ~ aElementOf0(X1,xI) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( X1 = sz00
| aElementOf0(esk3_1(X1),xI)
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
( esk3_1(esk2_0) = sz00
| X1 = sz00
| ~ aElementOf0(X1,xI) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16])]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( X1 = sz00
| ~ aElementOf0(X1,xI)
| esk3_1(X1) != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,hypothesis,
esk3_1(esk2_0) = sz00,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_17]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG112+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon May 30 09:47:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.019 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 24
% 0.22/1.41 # Proof object clause steps : 16
% 0.22/1.41 # Proof object formula steps : 8
% 0.22/1.41 # Proof object conjectures : 9
% 0.22/1.41 # Proof object clause conjectures : 6
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 9
% 0.22/1.41 # Proof object initial formulas used : 4
% 0.22/1.41 # Proof object generating inferences : 6
% 0.22/1.41 # Proof object simplifying inferences : 13
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 46
% 0.22/1.41 # Removed by relevancy pruning/SinE : 14
% 0.22/1.41 # Initial clauses : 72
% 0.22/1.41 # Removed in clause preprocessing : 4
% 0.22/1.41 # Initial clauses in saturation : 68
% 0.22/1.41 # Processed clauses : 81
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 2
% 0.22/1.41 # ...remaining for further processing : 79
% 0.22/1.41 # Other redundant clauses eliminated : 1
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 1
% 0.22/1.41 # Backward-rewritten : 2
% 0.22/1.41 # Generated clauses : 177
% 0.22/1.41 # ...of the previous two non-trivial : 152
% 0.22/1.41 # Contextual simplify-reflections : 1
% 0.22/1.41 # Paramodulations : 171
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 6
% 0.22/1.41 # Current number of processed clauses : 76
% 0.22/1.41 # Positive orientable unit clauses : 16
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 58
% 0.22/1.41 # Current number of unprocessed clauses: 124
% 0.22/1.41 # ...number of literals in the above : 609
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 3
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 761
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 252
% 0.22/1.41 # Non-unit clause-clause subsumptions : 3
% 0.22/1.41 # Unit Clause-clause subsumption calls : 179
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 2
% 0.22/1.41 # BW rewrite match successes : 2
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 7628
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.024 s
% 0.22/1.41 # System time : 0.004 s
% 0.22/1.41 # Total time : 0.028 s
% 0.22/1.41 # Maximum resident set size: 3400 pages
%------------------------------------------------------------------------------