TSTP Solution File: RNG050+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG050+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:43 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 40 ( 14 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 38 ( 16 ~; 12 |; 3 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aDimensionOf0(xs) != sz00
=> sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) )
=> sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mDefSPZ,axiom,
! [X1,X2] :
( ( aVector0(X1)
& aVector0(X2) )
=> ( ( aDimensionOf0(X1) = aDimensionOf0(X2)
& aDimensionOf0(X2) = sz00 )
=> sdtasasdt0(X1,X2) = sz0z00 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSPZ) ).
fof(m__1542,hypothesis,
aVector0(xs),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1542) ).
fof(mLERef,axiom,
! [X1] :
( aScalar0(X1)
=> sdtlseqdt0(X1,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLERef) ).
fof(mSZeroSc,axiom,
aScalar0(sz0z00),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSZeroSc) ).
fof(c_0_5,negated_conjecture,
~ ( ( aDimensionOf0(xs) != sz00
=> sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) )
=> sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
( ( aDimensionOf0(xs) = sz00
| sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) )
& ~ sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ~ aVector0(X3)
| ~ aVector0(X4)
| aDimensionOf0(X3) != aDimensionOf0(X4)
| aDimensionOf0(X4) != sz00
| sdtasasdt0(X3,X4) = sz0z00 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSPZ])]) ).
cnf(c_0_8,negated_conjecture,
( sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs))
| aDimensionOf0(xs) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
~ sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( sdtasasdt0(X1,X2) = sz0z00
| aDimensionOf0(X2) != sz00
| aDimensionOf0(X1) != aDimensionOf0(X2)
| ~ aVector0(X2)
| ~ aVector0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
aDimensionOf0(xs) = sz00,
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,hypothesis,
aVector0(xs),
inference(split_conjunct,[status(thm)],[m__1542]) ).
fof(c_0_13,plain,
! [X2] :
( ~ aScalar0(X2)
| sdtlseqdt0(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLERef])]) ).
cnf(c_0_14,negated_conjecture,
~ sdtlseqdt0(sz0z00,sz0z00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_15,plain,
( sdtlseqdt0(X1,X1)
| ~ aScalar0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
aScalar0(sz0z00),
inference(split_conjunct,[status(thm)],[mSZeroSc]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : RNG050+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 15:49:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.016 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 18
% 0.22/1.40 # Proof object clause steps : 9
% 0.22/1.40 # Proof object formula steps : 9
% 0.22/1.40 # Proof object conjectures : 8
% 0.22/1.40 # Proof object clause conjectures : 5
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 6
% 0.22/1.40 # Proof object initial formulas used : 5
% 0.22/1.40 # Proof object generating inferences : 2
% 0.22/1.40 # Proof object simplifying inferences : 6
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 39
% 0.22/1.40 # Removed by relevancy pruning/SinE : 8
% 0.22/1.40 # Initial clauses : 39
% 0.22/1.40 # Removed in clause preprocessing : 5
% 0.22/1.40 # Initial clauses in saturation : 34
% 0.22/1.40 # Processed clauses : 36
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 0
% 0.22/1.40 # ...remaining for further processing : 36
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 77
% 0.22/1.40 # ...of the previous two non-trivial : 69
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 75
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 2
% 0.22/1.40 # Current number of processed clauses : 36
% 0.22/1.40 # Positive orientable unit clauses : 4
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 3
% 0.22/1.40 # Non-unit-clauses : 29
% 0.22/1.40 # Current number of unprocessed clauses: 67
% 0.22/1.40 # ...number of literals in the above : 459
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 0
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 235
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 75
% 0.22/1.40 # Non-unit clause-clause subsumptions : 0
% 0.22/1.40 # Unit Clause-clause subsumption calls : 19
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 0
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 4594
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.019 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.020 s
% 0.22/1.40 # Maximum resident set size: 3036 pages
%------------------------------------------------------------------------------