TSTP Solution File: RNG121+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG121+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:45 EDT 2024
% Result : Theorem 3.95s 1.15s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0] :
( aElement0(X0)
=> ( sdtpldt0(sz00,X0) = X0
& sdtpldt0(X0,sz00) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddZero) ).
fof(f39,axiom,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
fof(f43,axiom,
( aElementOf0(xb,slsdtgt0(xb))
& ? [X0] :
( xb = sdtasdt0(xb,X0)
& aElement0(X0) )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [X0] :
( sz00 = sdtasdt0(xb,X0)
& aElement0(X0) )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X0] :
( xa = sdtasdt0(xa,X0)
& aElement0(X0) )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X0] :
( sz00 = sdtasdt0(xa,X0)
& aElement0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2203) ).
fof(f53,conjecture,
( aElementOf0(xb,xI)
| ? [X0,X1] :
( sdtpldt0(X0,X1) = xb
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) )
| ? [X0,X1] :
( sdtpldt0(X0,X1) = xb
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f54,negated_conjecture,
~ ( aElementOf0(xb,xI)
| ? [X0,X1] :
( sdtpldt0(X0,X1) = xb
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) )
| ? [X0,X1] :
( sdtpldt0(X0,X1) = xb
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f64,plain,
( aElementOf0(xb,slsdtgt0(xb))
& ? [X0] :
( xb = sdtasdt0(xb,X0)
& aElement0(X0) )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [X1] :
( sz00 = sdtasdt0(xb,X1)
& aElement0(X1) )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X2] :
( xa = sdtasdt0(xa,X2)
& aElement0(X2) )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X3] :
( sz00 = sdtasdt0(xa,X3)
& aElement0(X3) ) ),
inference(rectify,[],[f43]) ).
fof(f69,plain,
~ ( aElementOf0(xb,xI)
| ? [X0,X1] :
( sdtpldt0(X0,X1) = xb
& aElementOf0(X1,slsdtgt0(xb))
& aElementOf0(X0,slsdtgt0(xa)) )
| ? [X2,X3] :
( xb = sdtpldt0(X2,X3)
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ),
inference(rectify,[],[f54]) ).
fof(f80,plain,
! [X0] :
( ( sdtpldt0(sz00,X0) = X0
& sdtpldt0(X0,sz00) = X0 )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f127,plain,
( ~ aElementOf0(xb,xI)
& ! [X0,X1] :
( sdtpldt0(X0,X1) != xb
| ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElementOf0(X0,slsdtgt0(xa)) )
& ! [X2,X3] :
( xb != sdtpldt0(X2,X3)
| ~ aElementOf0(X3,slsdtgt0(xb))
| ~ aElementOf0(X2,slsdtgt0(xa)) ) ),
inference(ennf_transformation,[],[f69]) ).
fof(f199,plain,
( ? [X0] :
( xb = sdtasdt0(xb,X0)
& aElement0(X0) )
=> ( xb = sdtasdt0(xb,sK32)
& aElement0(sK32) ) ),
introduced(choice_axiom,[]) ).
fof(f200,plain,
( ? [X1] :
( sz00 = sdtasdt0(xb,X1)
& aElement0(X1) )
=> ( sz00 = sdtasdt0(xb,sK33)
& aElement0(sK33) ) ),
introduced(choice_axiom,[]) ).
fof(f201,plain,
( ? [X2] :
( xa = sdtasdt0(xa,X2)
& aElement0(X2) )
=> ( xa = sdtasdt0(xa,sK34)
& aElement0(sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f202,plain,
( ? [X3] :
( sz00 = sdtasdt0(xa,X3)
& aElement0(X3) )
=> ( sz00 = sdtasdt0(xa,sK35)
& aElement0(sK35) ) ),
introduced(choice_axiom,[]) ).
fof(f203,plain,
( aElementOf0(xb,slsdtgt0(xb))
& xb = sdtasdt0(xb,sK32)
& aElement0(sK32)
& aElementOf0(sz00,slsdtgt0(xb))
& sz00 = sdtasdt0(xb,sK33)
& aElement0(sK33)
& aElementOf0(xa,slsdtgt0(xa))
& xa = sdtasdt0(xa,sK34)
& aElement0(sK34)
& aElementOf0(sz00,slsdtgt0(xa))
& sz00 = sdtasdt0(xa,sK35)
& aElement0(sK35) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK32,sK33,sK34,sK35])],[f64,f202,f201,f200,f199]) ).
fof(f229,plain,
! [X0] :
( sdtpldt0(sz00,X0) = X0
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f313,plain,
aElement0(xb),
inference(cnf_transformation,[],[f39]) ).
fof(f352,plain,
aElementOf0(sz00,slsdtgt0(xa)),
inference(cnf_transformation,[],[f203]) ).
fof(f361,plain,
aElementOf0(xb,slsdtgt0(xb)),
inference(cnf_transformation,[],[f203]) ).
fof(f404,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) != xb
| ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElementOf0(X0,slsdtgt0(xa)) ),
inference(cnf_transformation,[],[f127]) ).
cnf(c_56,plain,
( ~ aElement0(X0)
| sdtpldt0(sz00,X0) = X0 ),
inference(cnf_transformation,[],[f229]) ).
cnf(c_140,plain,
aElement0(xb),
inference(cnf_transformation,[],[f313]) ).
cnf(c_178,plain,
aElementOf0(xb,slsdtgt0(xb)),
inference(cnf_transformation,[],[f361]) ).
cnf(c_187,plain,
aElementOf0(sz00,slsdtgt0(xa)),
inference(cnf_transformation,[],[f352]) ).
cnf(c_232,negated_conjecture,
( sdtpldt0(X0,X1) != xb
| ~ aElementOf0(X0,slsdtgt0(xa))
| ~ aElementOf0(X1,slsdtgt0(xb)) ),
inference(cnf_transformation,[],[f404]) ).
cnf(c_7798,plain,
slsdtgt0(xa) = sP0_iProver_def,
definition ).
cnf(c_7799,plain,
slsdtgt0(xb) = sP1_iProver_def,
definition ).
cnf(c_7800,negated_conjecture,
( sdtpldt0(X0,X1) != xb
| ~ aElementOf0(X0,sP0_iProver_def)
| ~ aElementOf0(X1,sP1_iProver_def) ),
inference(demodulation,[status(thm)],[c_232,c_7799,c_7798]) ).
cnf(c_9870,plain,
aElementOf0(xb,sP1_iProver_def),
inference(light_normalisation,[status(thm)],[c_178,c_7799]) ).
cnf(c_9873,plain,
aElementOf0(sz00,sP0_iProver_def),
inference(light_normalisation,[status(thm)],[c_187,c_7798]) ).
cnf(c_9999,plain,
sdtpldt0(sz00,xb) = xb,
inference(superposition,[status(thm)],[c_140,c_56]) ).
cnf(c_10151,plain,
( ~ aElementOf0(sz00,sP0_iProver_def)
| ~ aElementOf0(xb,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_9999,c_7800]) ).
cnf(c_10152,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10151,c_9870,c_9873]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG121+4 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu May 2 21:13:35 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.95/1.15 % SZS status Started for theBenchmark.p
% 3.95/1.15 % SZS status Theorem for theBenchmark.p
% 3.95/1.15
% 3.95/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.95/1.15
% 3.95/1.15 ------ iProver source info
% 3.95/1.15
% 3.95/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.95/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.95/1.15 git: non_committed_changes: false
% 3.95/1.15
% 3.95/1.15 ------ Parsing...
% 3.95/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.95/1.15
% 3.95/1.15 ------ Preprocessing... sup_sim: 2 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.95/1.15
% 3.95/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.95/1.15
% 3.95/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.95/1.15 ------ Proving...
% 3.95/1.15 ------ Problem Properties
% 3.95/1.15
% 3.95/1.15
% 3.95/1.15 clauses 173
% 3.95/1.15 conjectures 2
% 3.95/1.15 EPR 48
% 3.95/1.15 Horn 146
% 3.95/1.15 unary 60
% 3.95/1.15 binary 33
% 3.95/1.15 lits 457
% 3.95/1.15 lits eq 76
% 3.95/1.15 fd_pure 0
% 3.95/1.15 fd_pseudo 0
% 3.95/1.15 fd_cond 5
% 3.95/1.15 fd_pseudo_cond 11
% 3.95/1.15 AC symbols 0
% 3.95/1.15
% 3.95/1.15 ------ Schedule dynamic 5 is on
% 3.95/1.15
% 3.95/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.95/1.15
% 3.95/1.15
% 3.95/1.15 ------
% 3.95/1.15 Current options:
% 3.95/1.15 ------
% 3.95/1.15
% 3.95/1.15
% 3.95/1.15
% 3.95/1.15
% 3.95/1.15 ------ Proving...
% 3.95/1.15
% 3.95/1.15
% 3.95/1.15 % SZS status Theorem for theBenchmark.p
% 3.95/1.15
% 3.95/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.95/1.16
% 3.95/1.16
%------------------------------------------------------------------------------