TSTP Solution File: RNG125+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG125+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:27:00 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 100 ( 5 equ)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 116 ( 47 ~; 40 |; 20 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 25 ( 2 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(mDefDvs,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aElement0(X2)
& doDivides0(X2,X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefDvs) ).
fof(m__2612,hypothesis,
~ ~ doDivides0(xu,xb),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2612) ).
fof(m__2383,hypothesis,
~ ( aDivisorOf0(xu,xa)
& aDivisorOf0(xu,xb) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2383) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2091) ).
fof(m__2479,hypothesis,
~ ~ doDivides0(xu,xa),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2479) ).
fof(c_0_9,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_10,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_11,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_12,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_14,plain,
! [X3,X4,X4] :
( ( aElement0(X4)
| ~ aDivisorOf0(X4,X3)
| ~ aElement0(X3) )
& ( doDivides0(X4,X3)
| ~ aDivisorOf0(X4,X3)
| ~ aElement0(X3) )
& ( ~ aElement0(X4)
| ~ doDivides0(X4,X3)
| aDivisorOf0(X4,X3)
| ~ aElement0(X3) ) ),
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)],[mDefDvs])])])])])]) ).
fof(c_0_15,hypothesis,
doDivides0(xu,xb),
inference(fof_simplification,[status(thm)],[m__2612]) ).
cnf(c_0_16,plain,
( aElement0(X1)
| ~ aElementOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,hypothesis,
( ~ aDivisorOf0(xu,xa)
| ~ aDivisorOf0(xu,xb) ),
inference(fof_nnf,[status(thm)],[m__2383]) ).
cnf(c_0_20,plain,
( aDivisorOf0(X2,X1)
| ~ aElement0(X1)
| ~ doDivides0(X2,X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
doDivides0(xu,xb),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_23,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
fof(c_0_24,hypothesis,
doDivides0(xu,xa),
inference(fof_simplification,[status(thm)],[m__2479]) ).
cnf(c_0_25,hypothesis,
( ~ aDivisorOf0(xu,xb)
| ~ aDivisorOf0(xu,xa) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,hypothesis,
aDivisorOf0(xu,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23])]) ).
cnf(c_0_27,hypothesis,
doDivides0(xu,xa),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_29,hypothesis,
~ aDivisorOf0(xu,xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_28])]),c_0_23])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG125+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon May 30 04:46:58 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.021 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 31
% 0.25/1.43 # Proof object clause steps : 15
% 0.25/1.43 # Proof object formula steps : 16
% 0.25/1.43 # Proof object conjectures : 0
% 0.25/1.43 # Proof object clause conjectures : 0
% 0.25/1.43 # Proof object formula conjectures : 0
% 0.25/1.43 # Proof object initial clauses used : 10
% 0.25/1.43 # Proof object initial formulas used : 9
% 0.25/1.43 # Proof object generating inferences : 4
% 0.25/1.43 # Proof object simplifying inferences : 13
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 50
% 0.25/1.43 # Removed by relevancy pruning/SinE : 11
% 0.25/1.43 # Initial clauses : 88
% 0.25/1.43 # Removed in clause preprocessing : 5
% 0.25/1.43 # Initial clauses in saturation : 83
% 0.25/1.43 # Processed clauses : 97
% 0.25/1.43 # ...of these trivial : 1
% 0.25/1.43 # ...subsumed : 2
% 0.25/1.43 # ...remaining for further processing : 93
% 0.25/1.43 # Other redundant clauses eliminated : 4
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 1
% 0.25/1.43 # Generated clauses : 174
% 0.25/1.43 # ...of the previous two non-trivial : 156
% 0.25/1.43 # Contextual simplify-reflections : 0
% 0.25/1.43 # Paramodulations : 165
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 9
% 0.25/1.43 # Current number of processed clauses : 92
% 0.25/1.43 # Positive orientable unit clauses : 24
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 3
% 0.25/1.43 # Non-unit-clauses : 65
% 0.25/1.43 # Current number of unprocessed clauses: 142
% 0.25/1.43 # ...number of literals in the above : 691
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 1
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 906
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 306
% 0.25/1.43 # Non-unit clause-clause subsumptions : 2
% 0.25/1.43 # Unit Clause-clause subsumption calls : 65
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 1
% 0.25/1.43 # BW rewrite match successes : 1
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 8395
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.028 s
% 0.25/1.43 # System time : 0.001 s
% 0.25/1.43 # Total time : 0.029 s
% 0.25/1.43 # Maximum resident set size: 3456 pages
%------------------------------------------------------------------------------