TSTP Solution File: RNG070+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG070+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.28s 1.18s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] :
( ( aScalar0(X1)
& aScalar0(X0) )
=> aScalar0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSumSc) ).
fof(f25,axiom,
! [X0,X1] :
( ( aScalar0(X1)
& aScalar0(X0) )
=> ( sdtlseqdt0(X1,X0)
| sdtlseqdt0(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLETot) ).
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(f60,axiom,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2590) ).
fof(f61,conjecture,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('/export/starexec/sandbox/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(f138,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f164,plain,
! [X0,X1] :
( sdtlseqdt0(X1,X0)
| sdtlseqdt0(X0,X1)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f206,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f52]) ).
fof(f208,plain,
aScalar0(xP),
inference(cnf_transformation,[],[f53]) ).
fof(f210,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f54]) ).
fof(f218,plain,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
inference(cnf_transformation,[],[f60]) ).
fof(f219,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,[],[f138]) ).
cnf(c_83,plain,
( ~ aScalar0(X0)
| ~ aScalar0(X1)
| sdtlseqdt0(X0,X1)
| sdtlseqdt0(X1,X0) ),
inference(cnf_transformation,[],[f164]) ).
cnf(c_126,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f206]) ).
cnf(c_128,plain,
aScalar0(xP),
inference(cnf_transformation,[],[f208]) ).
cnf(c_130,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f210]) ).
cnf(c_137,plain,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
inference(cnf_transformation,[],[f218]) ).
cnf(c_138,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(cnf_transformation,[],[f219]) ).
cnf(c_1834,plain,
sdtpldt0(xR,xS) = sP3_iProver_def,
definition ).
cnf(c_1835,plain,
sdtpldt0(xP,xP) = sP4_iProver_def,
definition ).
cnf(c_1836,negated_conjecture,
~ sdtlseqdt0(sP3_iProver_def,sP4_iProver_def),
inference(demodulation,[status(thm)],[c_138,c_1835,c_1834]) ).
cnf(c_2940,plain,
~ sdtlseqdt0(sP4_iProver_def,sP3_iProver_def),
inference(light_normalisation,[status(thm)],[c_137,c_1834,c_1835]) ).
cnf(c_3077,plain,
( ~ aScalar0(xP)
| aScalar0(sP4_iProver_def) ),
inference(superposition,[status(thm)],[c_1835,c_57]) ).
cnf(c_3078,plain,
( ~ aScalar0(xR)
| ~ aScalar0(xS)
| aScalar0(sP3_iProver_def) ),
inference(superposition,[status(thm)],[c_1834,c_57]) ).
cnf(c_3084,plain,
aScalar0(sP4_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_3077,c_128]) ).
cnf(c_3085,plain,
aScalar0(sP3_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_3078,c_130,c_126]) ).
cnf(c_3349,plain,
( ~ aScalar0(sP3_iProver_def)
| ~ aScalar0(sP4_iProver_def)
| sdtlseqdt0(sP3_iProver_def,sP4_iProver_def) ),
inference(superposition,[status(thm)],[c_83,c_2940]) ).
cnf(c_3352,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3349,c_1836,c_3084,c_3085]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG070+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n024.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 : 300
% 0.14/0.35 % DateTime : Thu May 2 21:18:06 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.28/1.18 % SZS status Started for theBenchmark.p
% 3.28/1.18 % SZS status Theorem for theBenchmark.p
% 3.28/1.18
% 3.28/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.28/1.18
% 3.28/1.18 ------ iProver source info
% 3.28/1.18
% 3.28/1.18 git: date: 2024-05-02 19:28:25 +0000
% 3.28/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.28/1.18 git: non_committed_changes: false
% 3.28/1.18
% 3.28/1.18 ------ Parsing...
% 3.28/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.28/1.18
% 3.28/1.18 ------ Preprocessing... sup_sim: 1 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.28/1.18
% 3.28/1.18 ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.28/1.18
% 3.28/1.18 ------ Preprocessing... sf_s rm: 4 0s sf_e sf_s rm: 0 0s sf_e
% 3.28/1.18 ------ Proving...
% 3.28/1.18 ------ Problem Properties
% 3.28/1.18
% 3.28/1.18
% 3.28/1.18 clauses 94
% 3.28/1.18 conjectures 1
% 3.28/1.18 EPR 26
% 3.28/1.18 Horn 82
% 3.28/1.18 unary 43
% 3.28/1.18 binary 17
% 3.28/1.18 lits 226
% 3.28/1.18 lits eq 69
% 3.28/1.18 fd_pure 0
% 3.28/1.18 fd_pseudo 0
% 3.28/1.18 fd_cond 1
% 3.28/1.18 fd_pseudo_cond 5
% 3.28/1.18 AC symbols 0
% 3.28/1.18
% 3.28/1.18 ------ Schedule dynamic 5 is on
% 3.28/1.18
% 3.28/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.28/1.18
% 3.28/1.18
% 3.28/1.18 ------
% 3.28/1.18 Current options:
% 3.28/1.18 ------
% 3.28/1.18
% 3.28/1.18
% 3.28/1.18
% 3.28/1.18
% 3.28/1.18 ------ Proving...
% 3.28/1.18
% 3.28/1.18
% 3.28/1.18 % SZS status Theorem for theBenchmark.p
% 3.28/1.18
% 3.28/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.28/1.18
% 3.28/1.18
%------------------------------------------------------------------------------