TSTP Solution File: RNG121+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG121+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:26 EDT 2023
% Result : Theorem 3.47s 1.16s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 113 ( 39 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 110 ( 25 ~; 22 |; 58 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn; 9 !; 24 ?)
% 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_257,plain,
( ~ aElement0(xb)
| sdtpldt0(sz00,xb) = xb ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_10139,plain,
( sdtpldt0(sz00,X0) != xb
| ~ aElementOf0(X0,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xa)) ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_10140,plain,
( sdtpldt0(sz00,xb) != xb
| ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
inference(instantiation,[status(thm)],[c_10139]) ).
cnf(c_10141,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10140,c_257,c_178,c_187,c_140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG121+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 02:46:25 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.47/1.16 % SZS status Started for theBenchmark.p
% 3.47/1.16 % SZS status Theorem for theBenchmark.p
% 3.47/1.16
% 3.47/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.47/1.16
% 3.47/1.16 ------ iProver source info
% 3.47/1.16
% 3.47/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.47/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.47/1.16 git: non_committed_changes: false
% 3.47/1.16 git: last_make_outside_of_git: false
% 3.47/1.16
% 3.47/1.16 ------ Parsing...
% 3.47/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.47/1.16
% 3.47/1.16 ------ 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.47/1.16
% 3.47/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.47/1.16
% 3.47/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.47/1.16 ------ Proving...
% 3.47/1.16 ------ Problem Properties
% 3.47/1.16
% 3.47/1.16
% 3.47/1.16 clauses 171
% 3.47/1.16 conjectures 2
% 3.47/1.16 EPR 48
% 3.47/1.16 Horn 144
% 3.47/1.16 unary 58
% 3.47/1.16 binary 33
% 3.47/1.16 lits 455
% 3.47/1.16 lits eq 74
% 3.47/1.16 fd_pure 0
% 3.47/1.16 fd_pseudo 0
% 3.47/1.16 fd_cond 5
% 3.47/1.16 fd_pseudo_cond 11
% 3.47/1.16 AC symbols 0
% 3.47/1.16
% 3.47/1.16 ------ Schedule dynamic 5 is on
% 3.47/1.16
% 3.47/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.47/1.16
% 3.47/1.16
% 3.47/1.16 ------
% 3.47/1.16 Current options:
% 3.47/1.16 ------
% 3.47/1.16
% 3.47/1.16
% 3.47/1.16
% 3.47/1.16
% 3.47/1.16 ------ Proving...
% 3.47/1.16
% 3.47/1.16
% 3.47/1.16 % SZS status Theorem for theBenchmark.p
% 3.47/1.16
% 3.47/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.47/1.16
% 3.47/1.16
%------------------------------------------------------------------------------