TSTP Solution File: RNG119+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG119+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:59 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 41 ( 15 unt; 0 def)
% Number of atoms : 139 ( 27 equ)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 162 ( 64 ~; 60 |; 26 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-2 aty)
% Number of variables : 47 ( 1 sgn 30 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
xr != sz00,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddZero) ).
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefIdeal) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(X1,X3) = X2 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEOfElem) ).
fof(m__2273,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2273) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2174) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulComm) ).
fof(m__2666,hypothesis,
( aElement0(xq)
& aElement0(xr)
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& ( xr = sz00
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2666) ).
fof(m__2612,hypothesis,
~ doDivides0(xu,xb),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2612) ).
fof(c_0_11,negated_conjecture,
~ ( xr != sz00 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_12,plain,
! [X2] :
( ( sdtpldt0(X2,sz00) = X2
| ~ aElement0(X2) )
& ( X2 = sdtpldt0(sz00,X2)
| ~ aElement0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).
fof(c_0_13,negated_conjecture,
xr = sz00,
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X4,X5,X6,X7,X4] :
( ( aSet0(X4)
| ~ aIdeal0(X4) )
& ( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4)
| ~ aElementOf0(X5,X4)
| ~ aIdeal0(X4) )
& ( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4)
| ~ aElementOf0(X5,X4)
| ~ aIdeal0(X4) )
& ( aElementOf0(esk13_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk15_1(X4))
| aElementOf0(esk14_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk15_1(X4),esk13_1(X4)),X4)
| aElementOf0(esk14_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk15_1(X4))
| ~ aElementOf0(sdtpldt0(esk13_1(X4),esk14_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk15_1(X4),esk13_1(X4)),X4)
| ~ aElementOf0(sdtpldt0(esk13_1(X4),esk14_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) ) ),
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)],[mDefIdeal])])])])])])]) ).
fof(c_0_15,plain,
! [X4,X5,X7] :
( ( aElement0(esk18_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aElement0(X4)
| ~ aElement0(X5) )
& ( sdtasdt0(X4,esk18_2(X4,X5)) = X5
| ~ doDivides0(X4,X5)
| ~ aElement0(X4)
| ~ aElement0(X5) )
& ( ~ aElement0(X7)
| sdtasdt0(X4,X7) != X5
| doDivides0(X4,X5)
| ~ aElement0(X4)
| ~ aElement0(X5) ) ),
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)],[mDefDiv])])])])])])]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| aElement0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_17,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
xr = sz00,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ aSet0(X3)
| ~ aElementOf0(X4,X3)
| aElement0(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)],[mEOfElem])])])])]) ).
fof(c_0_20,hypothesis,
! [X2] :
( aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X2,xI)
| X2 = sz00
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) ) ),
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)],[inference(fof_simplification,[status(thm)],[m__2273])])])])])]) ).
cnf(c_0_21,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
cnf(c_0_23,plain,
( doDivides0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2)
| sdtasdt0(X2,X3) != X1
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
cnf(c_0_26,hypothesis,
xb = sdtpldt0(sdtasdt0(xq,xu),xr),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_27,plain,
( sdtpldt0(X1,xr) = X1
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_28,plain,
( aElement0(X1)
| ~ aElementOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_23]),c_0_24]) ).
cnf(c_0_32,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,hypothesis,
( sdtasdt0(xq,xu) = xb
| ~ aElement0(sdtasdt0(xq,xu)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,hypothesis,
aElement0(xq),
inference(split_conjunct,[status(thm)],[m__2666]) ).
fof(c_0_36,hypothesis,
~ doDivides0(xu,xb),
inference(fof_simplification,[status(thm)],[m__2612]) ).
cnf(c_0_37,plain,
( doDivides0(X1,sdtasdt0(X2,X1))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,hypothesis,
sdtasdt0(xq,xu) = xb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_34]),c_0_35])]) ).
cnf(c_0_39,hypothesis,
~ doDivides0(xu,xb),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35]),c_0_34])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : RNG119+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n023.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon May 30 05:48:57 EDT 2022
% 0.13/0.35 % 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 : 41
% 0.24/1.42 # Proof object clause steps : 20
% 0.24/1.42 # Proof object formula steps : 21
% 0.24/1.42 # Proof object conjectures : 4
% 0.24/1.42 # Proof object clause conjectures : 1
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 12
% 0.24/1.42 # Proof object initial formulas used : 11
% 0.24/1.42 # Proof object generating inferences : 7
% 0.24/1.42 # Proof object simplifying inferences : 11
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 51
% 0.24/1.42 # Removed by relevancy pruning/SinE : 11
% 0.24/1.42 # Initial clauses : 92
% 0.24/1.42 # Removed in clause preprocessing : 4
% 0.24/1.42 # Initial clauses in saturation : 88
% 0.24/1.42 # Processed clauses : 212
% 0.24/1.42 # ...of these trivial : 13
% 0.24/1.42 # ...subsumed : 24
% 0.24/1.42 # ...remaining for further processing : 175
% 0.24/1.42 # Other redundant clauses eliminated : 8
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 14
% 0.24/1.42 # Backward-rewritten : 6
% 0.24/1.42 # Generated clauses : 487
% 0.24/1.42 # ...of the previous two non-trivial : 424
% 0.24/1.42 # Contextual simplify-reflections : 14
% 0.24/1.42 # Paramodulations : 461
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 26
% 0.24/1.42 # Current number of processed clauses : 155
% 0.24/1.42 # Positive orientable unit clauses : 43
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 5
% 0.24/1.42 # Non-unit-clauses : 107
% 0.24/1.42 # Current number of unprocessed clauses: 248
% 0.24/1.42 # ...number of literals in the above : 1135
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 20
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 3018
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 1288
% 0.24/1.42 # Non-unit clause-clause subsumptions : 49
% 0.24/1.42 # Unit Clause-clause subsumption calls : 268
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 6
% 0.24/1.42 # BW rewrite match successes : 5
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 12757
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.032 s
% 0.24/1.42 # System time : 0.005 s
% 0.24/1.42 # Total time : 0.037 s
% 0.24/1.42 # Maximum resident set size: 3732 pages
%------------------------------------------------------------------------------