TSTP Solution File: RNG070+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG070+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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 : Thu Aug 31 13:55:04 EDT 2023
% Result : Theorem 2.70s 1.16s
% Output : CNFRefutation 2.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 16 unt; 0 def)
% Number of atoms : 66 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 65 ( 32 ~; 26 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] :
( ( aScalar0(X1)
& aScalar0(X0) )
=> aScalar0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSumSc) ).
fof(f25,axiom,
! [X0,X1] :
( ( aScalar0(X1)
& aScalar0(X0) )
=> ( sdtlseqdt0(X1,X0)
| sdtlseqdt0(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLETot) ).
fof(f52,axiom,
( xR = sdtasdt0(xC,xG)
& aScalar0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1892) ).
fof(f53,axiom,
( xP = sdtasdt0(xE,xH)
& aScalar0(xP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1911) ).
fof(f54,axiom,
( xS = sdtasdt0(xF,xD)
& aScalar0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1930) ).
fof(f60,axiom,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2590) ).
fof(f61,conjecture,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f62,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(negated_conjecture,[],[f61]) ).
fof(f68,plain,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(flattening,[],[f62]) ).
fof(f75,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f76,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(flattening,[],[f75]) ).
fof(f100,plain,
! [X0,X1] :
( sdtlseqdt0(X1,X0)
| sdtlseqdt0(X0,X1)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f101,plain,
! [X0,X1] :
( sdtlseqdt0(X1,X0)
| sdtlseqdt0(X0,X1)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(flattening,[],[f100]) ).
fof(f140,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f166,plain,
! [X0,X1] :
( sdtlseqdt0(X1,X0)
| sdtlseqdt0(X0,X1)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f212,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f52]) ).
fof(f214,plain,
aScalar0(xP),
inference(cnf_transformation,[],[f53]) ).
fof(f216,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f54]) ).
fof(f224,plain,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
inference(cnf_transformation,[],[f60]) ).
fof(f225,plain,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(cnf_transformation,[],[f68]) ).
cnf(c_57,plain,
( ~ aScalar0(X0)
| ~ aScalar0(X1)
| aScalar0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f140]) ).
cnf(c_83,plain,
( ~ aScalar0(X0)
| ~ aScalar0(X1)
| sdtlseqdt0(X0,X1)
| sdtlseqdt0(X1,X0) ),
inference(cnf_transformation,[],[f166]) ).
cnf(c_130,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f212]) ).
cnf(c_132,plain,
aScalar0(xP),
inference(cnf_transformation,[],[f214]) ).
cnf(c_134,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f216]) ).
cnf(c_141,plain,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
inference(cnf_transformation,[],[f224]) ).
cnf(c_142,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(cnf_transformation,[],[f225]) ).
cnf(c_3443,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP))
| sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)) ),
inference(superposition,[status(thm)],[c_83,c_142]) ).
cnf(c_3446,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3443,c_141]) ).
cnf(c_3485,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(xP) ),
inference(superposition,[status(thm)],[c_57,c_3446]) ).
cnf(c_3486,plain,
~ aScalar0(sdtpldt0(xR,xS)),
inference(forward_subsumption_resolution,[status(thm)],[c_3485,c_132]) ).
cnf(c_3487,plain,
( ~ aScalar0(xR)
| ~ aScalar0(xS) ),
inference(superposition,[status(thm)],[c_57,c_3486]) ).
cnf(c_3488,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3487,c_134,c_130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG070+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n006.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 : 300
% 0.13/0.34 % DateTime : Sun Aug 27 01:45:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.70/1.16 % SZS status Started for theBenchmark.p
% 2.70/1.16 % SZS status Theorem for theBenchmark.p
% 2.70/1.16
% 2.70/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.70/1.16
% 2.70/1.16 ------ iProver source info
% 2.70/1.16
% 2.70/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.70/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.70/1.16 git: non_committed_changes: false
% 2.70/1.16 git: last_make_outside_of_git: false
% 2.70/1.16
% 2.70/1.16 ------ Parsing...
% 2.70/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.70/1.16
% 2.70/1.16 ------ Preprocessing... sup_sim: 2 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
% 2.70/1.16
% 2.70/1.16 ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.70/1.16
% 2.70/1.16 ------ Preprocessing... sf_s rm: 4 0s sf_e sf_s rm: 0 0s sf_e
% 2.70/1.16 ------ Proving...
% 2.70/1.16 ------ Problem Properties
% 2.70/1.16
% 2.70/1.16
% 2.70/1.16 clauses 96
% 2.70/1.16 conjectures 1
% 2.70/1.16 EPR 25
% 2.70/1.16 Horn 84
% 2.70/1.16 unary 43
% 2.70/1.16 binary 19
% 2.70/1.16 lits 230
% 2.70/1.16 lits eq 71
% 2.70/1.16 fd_pure 0
% 2.70/1.16 fd_pseudo 0
% 2.70/1.16 fd_cond 1
% 2.70/1.16 fd_pseudo_cond 5
% 2.70/1.16 AC symbols 0
% 2.70/1.16
% 2.70/1.16 ------ Schedule dynamic 5 is on
% 2.70/1.16
% 2.70/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.70/1.16
% 2.70/1.16
% 2.70/1.16 ------
% 2.70/1.16 Current options:
% 2.70/1.16 ------
% 2.70/1.16
% 2.70/1.16
% 2.70/1.16
% 2.70/1.16
% 2.70/1.16 ------ Proving...
% 2.70/1.16
% 2.70/1.16
% 2.70/1.16 % SZS status Theorem for theBenchmark.p
% 2.70/1.16
% 2.70/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.70/1.16
% 2.70/1.16
%------------------------------------------------------------------------------