TSTP Solution File: RNG069+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG069+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:47 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 16 unt; 0 def)
% Number of atoms : 71 ( 15 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 69 ( 29 ~; 25 |; 12 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2580,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xR,xS)),sdtpldt0(sdtasdt0(xS,xR),sdtasdt0(xS,xS)))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2580) ).
fof(m__1949,hypothesis,
( aScalar0(xN)
& xN = sdtasdt0(xR,xS) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1949) ).
fof(mDistr2,axiom,
! [X1,X2,X3,X4] :
( ( aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3)
& aScalar0(X4) )
=> sdtasdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4)) = sdtpldt0(sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X1,X4)),sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X2,X4))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDistr2) ).
fof(m__1911,hypothesis,
( aScalar0(xP)
& xP = sdtasdt0(xE,xH) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1911) ).
fof(mDistr,axiom,
! [X1,X2,X3] :
( ( aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDistr) ).
fof(m__1930,hypothesis,
( aScalar0(xS)
& xS = sdtasdt0(xF,xD) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1930) ).
fof(m__1892,hypothesis,
( aScalar0(xR)
& xR = sdtasdt0(xC,xG) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1892) ).
fof(m__,conjecture,
sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mSumSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSumSc) ).
cnf(c_0_9,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xR,xS)),sdtpldt0(sdtasdt0(xS,xR),sdtasdt0(xS,xS)))),
inference(split_conjunct,[status(thm)],[m__2580]) ).
cnf(c_0_10,hypothesis,
xN = sdtasdt0(xR,xS),
inference(split_conjunct,[status(thm)],[m__1949]) ).
fof(c_0_11,plain,
! [X5,X6,X7,X8] :
( ~ aScalar0(X5)
| ~ aScalar0(X6)
| ~ aScalar0(X7)
| ~ aScalar0(X8)
| sdtasdt0(sdtpldt0(X5,X6),sdtpldt0(X7,X8)) = sdtpldt0(sdtpldt0(sdtasdt0(X5,X7),sdtasdt0(X5,X8)),sdtpldt0(sdtasdt0(X6,X7),sdtasdt0(X6,X8))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDistr2])]) ).
cnf(c_0_12,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtpldt0(sdtasdt0(xS,xR),sdtasdt0(xS,xS)))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( sdtasdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4)) = sdtpldt0(sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X1,X4)),sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X2,X4)))
| ~ aScalar0(X4)
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[m__1911]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
| ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ aScalar0(X6) )
& ( sdtasdt0(sdtpldt0(X4,X5),X6) = sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6))
| ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ aScalar0(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDistr])])]) ).
cnf(c_0_16,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtpldt0(sdtasdt0(xS,xR),sdtasdt0(xS,xS)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_19,hypothesis,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[m__1892]) ).
fof(c_0_20,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_21,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtasdt0(xS,sdtpldt0(xR,xS)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_22,hypothesis,
( sdtpldt0(sdtasdt0(xR,X1),xN) = sdtasdt0(xR,sdtpldt0(X1,xS))
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_10]),c_0_19]),c_0_18])]) ).
fof(c_0_23,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
cnf(c_0_24,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtasdt0(xR,sdtpldt0(xR,xS)),sdtasdt0(xS,sdtpldt0(xR,xS)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_19])]) ).
cnf(c_0_25,plain,
( sdtasdt0(sdtpldt0(X3,X2),X1) = sdtpldt0(sdtasdt0(X3,X1),sdtasdt0(X2,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_27,plain,
! [X3,X4] :
( ~ aScalar0(X3)
| ~ aScalar0(X4)
| aScalar0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSumSc])]) ).
cnf(c_0_28,hypothesis,
~ aScalar0(sdtpldt0(xR,xS)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19]),c_0_18])]),c_0_26]) ).
cnf(c_0_29,plain,
( aScalar0(sdtpldt0(X1,X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG069+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n019.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon May 30 19:22:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.018 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 31
% 0.23/1.42 # Proof object clause steps : 17
% 0.23/1.42 # Proof object formula steps : 14
% 0.23/1.42 # Proof object conjectures : 4
% 0.23/1.42 # Proof object clause conjectures : 1
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 10
% 0.23/1.42 # Proof object initial formulas used : 9
% 0.23/1.42 # Proof object generating inferences : 6
% 0.23/1.42 # Proof object simplifying inferences : 18
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 62
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 100
% 0.23/1.42 # Removed in clause preprocessing : 5
% 0.23/1.42 # Initial clauses in saturation : 95
% 0.23/1.42 # Processed clauses : 875
% 0.23/1.42 # ...of these trivial : 19
% 0.23/1.42 # ...subsumed : 244
% 0.23/1.42 # ...remaining for further processing : 612
% 0.23/1.42 # Other redundant clauses eliminated : 1
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 10
% 0.23/1.42 # Backward-rewritten : 41
% 0.23/1.42 # Generated clauses : 8337
% 0.23/1.42 # ...of the previous two non-trivial : 7646
% 0.23/1.42 # Contextual simplify-reflections : 177
% 0.23/1.42 # Paramodulations : 8316
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 15
% 0.23/1.42 # Current number of processed clauses : 559
% 0.23/1.42 # Positive orientable unit clauses : 105
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 5
% 0.23/1.42 # Non-unit-clauses : 449
% 0.23/1.42 # Current number of unprocessed clauses: 6552
% 0.23/1.42 # ...number of literals in the above : 36741
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 51
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 74912
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 18987
% 0.23/1.42 # Non-unit clause-clause subsumptions : 423
% 0.23/1.42 # Unit Clause-clause subsumption calls : 1766
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 24
% 0.23/1.42 # BW rewrite match successes : 12
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 193930
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.188 s
% 0.23/1.42 # System time : 0.009 s
% 0.23/1.42 # Total time : 0.197 s
% 0.23/1.42 # Maximum resident set size: 10720 pages
%------------------------------------------------------------------------------