TSTP Solution File: RNG072+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG072+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 : 300s
% DateTime : Fri May 3 02:57:30 EDT 2024
% Result : Theorem 3.66s 1.13s
% Output : CNFRefutation 3.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 17 unt; 0 def)
% Number of atoms : 101 ( 3 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 121 ( 56 ~; 52 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 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 : 36 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] :
( ( aScalar0(X1)
& aScalar0(X0) )
=> aScalar0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSumSc) ).
fof(f24,axiom,
! [X0,X1,X2,X3] :
( ( aScalar0(X3)
& aScalar0(X2)
& aScalar0(X1)
& aScalar0(X0) )
=> ( ( sdtlseqdt0(X2,X3)
& sdtlseqdt0(sz0z00,X2)
& sdtlseqdt0(X0,X1) )
=> sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLEMonM) ).
fof(f52,axiom,
( xR = sdtasdt0(xC,xG)
& aScalar0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1892) ).
fof(f53,axiom,
( xP = sdtasdt0(xE,xH)
& aScalar0(xP) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1911) ).
fof(f54,axiom,
( xS = sdtasdt0(xF,xD)
& aScalar0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1930) ).
fof(f61,axiom,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2610) ).
fof(f62,axiom,
( sdtlseqdt0(sz0z00,sdtpldt0(xP,xP))
& sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2628) ).
fof(f63,conjecture,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f64,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(negated_conjecture,[],[f63]) ).
fof(f70,plain,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(flattening,[],[f64]) ).
fof(f77,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f78,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(flattening,[],[f77]) ).
fof(f100,plain,
! [X0,X1,X2,X3] :
( sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3))
| ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X0,X1)
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f101,plain,
! [X0,X1,X2,X3] :
( sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3))
| ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X0,X1)
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(flattening,[],[f100]) ).
fof(f140,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f165,plain,
! [X2,X3,X0,X1] :
( sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3))
| ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X0,X1)
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f208,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f52]) ).
fof(f210,plain,
aScalar0(xP),
inference(cnf_transformation,[],[f53]) ).
fof(f212,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f54]) ).
fof(f221,plain,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(cnf_transformation,[],[f61]) ).
fof(f222,plain,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(cnf_transformation,[],[f62]) ).
fof(f224,plain,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(cnf_transformation,[],[f70]) ).
cnf(c_57,plain,
( ~ aScalar0(X0)
| ~ aScalar0(X1)
| aScalar0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f140]) ).
cnf(c_82,plain,
( ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3)
| sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3)) ),
inference(cnf_transformation,[],[f165]) ).
cnf(c_126,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f208]) ).
cnf(c_128,plain,
aScalar0(xP),
inference(cnf_transformation,[],[f210]) ).
cnf(c_130,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f212]) ).
cnf(c_138,plain,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(cnf_transformation,[],[f221]) ).
cnf(c_140,plain,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(cnf_transformation,[],[f222]) ).
cnf(c_141,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(cnf_transformation,[],[f224]) ).
cnf(c_1195,plain,
( ~ sdtlseqdt0(X0_15,X1_15)
| ~ sdtlseqdt0(X2_15,X3_15)
| ~ sdtlseqdt0(sz0z00,X2_15)
| ~ aScalar0(X0_15)
| ~ aScalar0(X1_15)
| ~ aScalar0(X2_15)
| ~ aScalar0(X3_15)
| sdtlseqdt0(sdtasdt0(X0_15,X2_15),sdtasdt0(X1_15,X3_15)) ),
inference(subtyping,[status(esa)],[c_82]) ).
cnf(c_1219,plain,
( ~ aScalar0(X0_15)
| ~ aScalar0(X1_15)
| aScalar0(sdtpldt0(X0_15,X1_15)) ),
inference(subtyping,[status(esa)],[c_57]) ).
cnf(c_2690,plain,
( ~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))
| ~ sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP))
| sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))) ),
inference(instantiation,[status(thm)],[c_1195]) ).
cnf(c_2797,plain,
( ~ aScalar0(xP)
| aScalar0(sdtpldt0(xP,xP)) ),
inference(instantiation,[status(thm)],[c_1219]) ).
cnf(c_3183,plain,
( ~ aScalar0(xR)
| ~ aScalar0(xS)
| aScalar0(sdtpldt0(xR,xS)) ),
inference(instantiation,[status(thm)],[c_1219]) ).
cnf(c_3184,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3183,c_2797,c_2690,c_141,c_138,c_140,c_126,c_128,c_130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : RNG072+1 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 21:19:50 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.66/1.13 % SZS status Started for theBenchmark.p
% 3.66/1.13 % SZS status Theorem for theBenchmark.p
% 3.66/1.13
% 3.66/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.66/1.13
% 3.66/1.13 ------ iProver source info
% 3.66/1.13
% 3.66/1.13 git: date: 2024-05-02 19:28:25 +0000
% 3.66/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.66/1.13 git: non_committed_changes: false
% 3.66/1.13
% 3.66/1.13 ------ Parsing...
% 3.66/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.66/1.13
% 3.66/1.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.66/1.13
% 3.66/1.13 ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.66/1.13
% 3.66/1.13 ------ Preprocessing... sf_s rm: 4 0s sf_e sf_s rm: 0 0s sf_e
% 3.66/1.13 ------ Proving...
% 3.66/1.13 ------ Problem Properties
% 3.66/1.13
% 3.66/1.13
% 3.66/1.13 clauses 95
% 3.66/1.13 conjectures 1
% 3.66/1.13 EPR 25
% 3.66/1.13 Horn 83
% 3.66/1.13 unary 44
% 3.66/1.13 binary 17
% 3.66/1.13 lits 227
% 3.66/1.13 lits eq 67
% 3.66/1.13 fd_pure 0
% 3.66/1.13 fd_pseudo 0
% 3.66/1.13 fd_cond 1
% 3.66/1.13 fd_pseudo_cond 5
% 3.66/1.13 AC symbols 0
% 3.66/1.13
% 3.66/1.13 ------ Input Options Time Limit: Unbounded
% 3.66/1.13
% 3.66/1.13
% 3.66/1.13 ------
% 3.66/1.13 Current options:
% 3.66/1.13 ------
% 3.66/1.13
% 3.66/1.13
% 3.66/1.13
% 3.66/1.13
% 3.66/1.13 ------ Proving...
% 3.66/1.13
% 3.66/1.13
% 3.66/1.13 % SZS status Theorem for theBenchmark.p
% 3.66/1.13
% 3.66/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.66/1.13
% 3.66/1.13
%------------------------------------------------------------------------------