TSTP Solution File: RNG102+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG102+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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:17 EDT 2023
% Result : Theorem 3.32s 1.15s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 45 ( 17 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 37 ( 8 ~; 3 |; 24 &)
% ( 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn; 2 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f39,axiom,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& ? [X0] :
( sdtasdt0(xc,X0) = xy
& aElement0(X0) )
& aElementOf0(xx,slsdtgt0(xc))
& ? [X0] :
( sdtasdt0(xc,X0) = xx
& aElement0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1933) ).
fof(f41,conjecture,
? [X0] :
( sdtasdt0(xc,X0) = xy
& aElement0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f42,negated_conjecture,
~ ? [X0] :
( sdtasdt0(xc,X0) = xy
& aElement0(X0) ),
inference(negated_conjecture,[],[f41]) ).
fof(f50,plain,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& ? [X0] :
( sdtasdt0(xc,X0) = xy
& aElement0(X0) )
& aElementOf0(xx,slsdtgt0(xc))
& ? [X1] :
( xx = sdtasdt0(xc,X1)
& aElement0(X1) ) ),
inference(rectify,[],[f39]) ).
fof(f101,plain,
! [X0] :
( sdtasdt0(xc,X0) != xy
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f154,plain,
( ? [X0] :
( sdtasdt0(xc,X0) = xy
& aElement0(X0) )
=> ( xy = sdtasdt0(xc,sK22)
& aElement0(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
( ? [X1] :
( xx = sdtasdt0(xc,X1)
& aElement0(X1) )
=> ( xx = sdtasdt0(xc,sK23)
& aElement0(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& xy = sdtasdt0(xc,sK22)
& aElement0(sK22)
& aElementOf0(xx,slsdtgt0(xc))
& xx = sdtasdt0(xc,sK23)
& aElement0(sK23) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22,sK23])],[f50,f155,f154]) ).
fof(f250,plain,
aElement0(sK22),
inference(cnf_transformation,[],[f156]) ).
fof(f251,plain,
xy = sdtasdt0(xc,sK22),
inference(cnf_transformation,[],[f156]) ).
fof(f256,plain,
! [X0] :
( sdtasdt0(xc,X0) != xy
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f101]) ).
cnf(c_141,plain,
sdtasdt0(xc,sK22) = xy,
inference(cnf_transformation,[],[f251]) ).
cnf(c_142,plain,
aElement0(sK22),
inference(cnf_transformation,[],[f250]) ).
cnf(c_148,negated_conjecture,
( sdtasdt0(xc,X0) != xy
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f256]) ).
cnf(c_6617,plain,
~ aElement0(sK22),
inference(superposition,[status(thm)],[c_141,c_148]) ).
cnf(c_6618,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6617,c_142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG102+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n012.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 02:28:40 EDT 2023
% 0.13/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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.32/1.15 % SZS status Started for theBenchmark.p
% 3.32/1.15 % SZS status Theorem for theBenchmark.p
% 3.32/1.15
% 3.32/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.32/1.15
% 3.32/1.15 ------ iProver source info
% 3.32/1.15
% 3.32/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.32/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.32/1.15 git: non_committed_changes: false
% 3.32/1.15 git: last_make_outside_of_git: false
% 3.32/1.15
% 3.32/1.15 ------ Parsing...
% 3.32/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.32/1.15
% 3.32/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 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.32/1.15
% 3.32/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.32/1.15
% 3.32/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.32/1.15 ------ Proving...
% 3.32/1.15 ------ Problem Properties
% 3.32/1.15
% 3.32/1.15
% 3.32/1.15 clauses 95
% 3.32/1.15 conjectures 1
% 3.32/1.15 EPR 17
% 3.32/1.15 Horn 72
% 3.32/1.15 unary 13
% 3.32/1.15 binary 15
% 3.32/1.15 lits 331
% 3.32/1.15 lits eq 46
% 3.32/1.15 fd_pure 0
% 3.32/1.15 fd_pseudo 0
% 3.32/1.15 fd_cond 3
% 3.32/1.15 fd_pseudo_cond 11
% 3.32/1.15 AC symbols 0
% 3.32/1.15
% 3.32/1.15 ------ Schedule dynamic 5 is on
% 3.32/1.15
% 3.32/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.32/1.15
% 3.32/1.15
% 3.32/1.15 ------
% 3.32/1.15 Current options:
% 3.32/1.15 ------
% 3.32/1.15
% 3.32/1.15
% 3.32/1.15
% 3.32/1.15
% 3.32/1.15 ------ Proving...
% 3.32/1.15
% 3.32/1.15
% 3.32/1.15 % SZS status Theorem for theBenchmark.p
% 3.32/1.15
% 3.32/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.32/1.15
% 3.32/1.15
%------------------------------------------------------------------------------