%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG111+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 96 ( 39 equ)
% Maximal formula atoms : 25 ( 5 avg)
% Number of connectives : 132 ( 53 ~; 44 |; 23 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 25 ( 0 sgn 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ( ! [X2] :
( ( aElementOf0(X2,xI)
& X2 != sz00 )
=> ( iLess0(sbrdtbr0(X2),sbrdtbr0(X1))
=> ? [X3] :
( aElementOf0(X3,xI)
& X3 != sz00
& ! [X4] :
( ( aElementOf0(X4,xI)
& X4 != sz00 )
=> ~ iLess0(sbrdtbr0(X4),sbrdtbr0(X3)) ) ) ) )
=> ? [X2] :
( aElementOf0(X2,xI)
& X2 != sz00
& ! [X3] :
( ( aElementOf0(X3,xI)
& X3 != sz00 )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ( ! [X2] :
( ( aElementOf0(X2,xI)
& X2 != sz00 )
=> ( iLess0(sbrdtbr0(X2),sbrdtbr0(X1))
=> ? [X3] :
( aElementOf0(X3,xI)
& X3 != sz00
& ! [X4] :
( ( aElementOf0(X4,xI)
& X4 != sz00 )
=> ~ iLess0(sbrdtbr0(X4),sbrdtbr0(X3)) ) ) ) )
=> ? [X2] :
( aElementOf0(X2,xI)
& X2 != sz00
& ! [X3] :
( ( aElementOf0(X3,xI)
& X3 != sz00 )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_2,negated_conjecture,
! [X6,X8,X9] :
( aElementOf0(esk2_0,xI)
& esk2_0 != sz00
& ( aElementOf0(esk3_1(X6),xI)
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(esk2_0))
| ~ aElementOf0(X6,xI)
| X6 = sz00 )
& ( esk3_1(X6) != sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(esk2_0))
| ~ aElementOf0(X6,xI)
| X6 = sz00 )
& ( ~ aElementOf0(X8,xI)
| X8 = sz00
| ~ iLess0(sbrdtbr0(X8),sbrdtbr0(esk3_1(X6)))
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(esk2_0))
| ~ aElementOf0(X6,xI)
| X6 = sz00 )
& ( aElementOf0(esk4_1(X9),xI)
| ~ aElementOf0(X9,xI)
| X9 = sz00 )
& ( esk4_1(X9) != sz00
| ~ aElementOf0(X9,xI)
| X9 = sz00 )
& ( iLess0(sbrdtbr0(esk4_1(X9)),sbrdtbr0(X9))
| ~ aElementOf0(X9,xI)
| X9 = 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)],[c_0_1])])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( X1 = sz00
| X2 = sz00
| ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk2_0))
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(esk3_1(X1)))
| ~ aElementOf0(X2,xI) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( X1 = sz00
| iLess0(sbrdtbr0(esk4_1(X1)),sbrdtbr0(X1))
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( X1 = sz00
| aElementOf0(esk3_1(X1),xI)
| ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( X1 = sz00
| ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk2_0))
| esk3_1(X1) != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( esk4_1(esk3_1(X1)) = sz00
| X1 = sz00
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk2_0))
| ~ aElementOf0(esk4_1(esk3_1(X1)),xI)
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]),c_0_6]) ).
cnf(c_0_8,negated_conjecture,
( X1 = sz00
| aElementOf0(esk4_1(X1),xI)
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( X1 = sz00
| ~ aElementOf0(X1,xI)
| esk4_1(X1) != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( esk4_1(esk3_1(X1)) = sz00
| X1 = sz00
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk2_0))
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_5]),c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( X1 = sz00
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk2_0))
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_5]),c_0_6]) ).
cnf(c_0_12,negated_conjecture,
aElementOf0(esk2_0,xI),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 != sz00,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( esk4_1(esk2_0) = sz00
| ~ aElementOf0(esk4_1(esk2_0),xI) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_4]),c_0_12])]),c_0_13]) ).
cnf(c_0_15,negated_conjecture,
esk4_1(esk2_0) = sz00,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_8]),c_0_12])]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_15]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG111+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon May 30 21:28:44 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.020 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 17
% 0.24/1.42 # Proof object clause steps : 14
% 0.24/1.42 # Proof object formula steps : 3
% 0.24/1.42 # Proof object conjectures : 17
% 0.24/1.42 # Proof object clause conjectures : 14
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 8
% 0.24/1.42 # Proof object initial formulas used : 1
% 0.24/1.42 # Proof object generating inferences : 6
% 0.24/1.42 # Proof object simplifying inferences : 15
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 45
% 0.24/1.42 # Removed by relevancy pruning/SinE : 14
% 0.24/1.42 # Initial clauses : 74
% 0.24/1.42 # Removed in clause preprocessing : 4
% 0.24/1.42 # Initial clauses in saturation : 70
% 0.24/1.42 # Processed clauses : 111
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 15
% 0.24/1.42 # ...remaining for further processing : 96
% 0.24/1.42 # Other redundant clauses eliminated : 2
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 11
% 0.24/1.42 # Backward-rewritten : 1
% 0.24/1.42 # Generated clauses : 212
% 0.24/1.42 # ...of the previous two non-trivial : 187
% 0.24/1.42 # Contextual simplify-reflections : 6
% 0.24/1.42 # Paramodulations : 203
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 9
% 0.24/1.42 # Current number of processed clauses : 84
% 0.24/1.42 # Positive orientable unit clauses : 16
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 66
% 0.24/1.42 # Current number of unprocessed clauses: 120
% 0.24/1.42 # ...number of literals in the above : 629
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 12
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 1093
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 399
% 0.24/1.42 # Non-unit clause-clause subsumptions : 32
% 0.24/1.42 # Unit Clause-clause subsumption calls : 70
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 1
% 0.24/1.42 # BW rewrite match successes : 1
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 8545
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.030 s
% 0.24/1.42 # System time : 0.005 s
% 0.24/1.42 # Total time : 0.035 s
% 0.24/1.42 # Maximum resident set size: 3404 pages
%------------------------------------------------------------------------------