TSTP Solution File: RNG087+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG087+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:11 EDT 2023
% Result : Theorem 2.84s 1.17s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 63 ( 17 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 57 ( 12 ~; 7 |; 36 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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; 9 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn; 4 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
( aElement0(xz)
& aElementOf0(xy,sdtpldt1(xI,xJ))
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xy
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) )
& aElementOf0(xx,sdtpldt1(xI,xJ))
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xx
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__901) ).
fof(f28,conjecture,
? [X0,X1] :
( sdtpldt0(X0,X1) = xy
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f29,negated_conjecture,
~ ? [X0,X1] :
( sdtpldt0(X0,X1) = xy
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
inference(negated_conjecture,[],[f28]) ).
fof(f35,plain,
( aElement0(xz)
& aElementOf0(xy,sdtpldt1(xI,xJ))
& ? [X0,X1] :
( sdtpldt0(X0,X1) = xy
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) )
& aElementOf0(xx,sdtpldt1(xI,xJ))
& ? [X2,X3] :
( xx = sdtpldt0(X2,X3)
& aElementOf0(X3,xJ)
& aElementOf0(X2,xI) ) ),
inference(rectify,[],[f26]) ).
fof(f68,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) != xy
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(ennf_transformation,[],[f29]) ).
fof(f88,plain,
( ? [X0,X1] :
( sdtpldt0(X0,X1) = xy
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) )
=> ( xy = sdtpldt0(sK10,sK11)
& aElementOf0(sK11,xJ)
& aElementOf0(sK10,xI) ) ),
introduced(choice_axiom,[]) ).
fof(f89,plain,
( ? [X2,X3] :
( xx = sdtpldt0(X2,X3)
& aElementOf0(X3,xJ)
& aElementOf0(X2,xI) )
=> ( xx = sdtpldt0(sK12,sK13)
& aElementOf0(sK13,xJ)
& aElementOf0(sK12,xI) ) ),
introduced(choice_axiom,[]) ).
fof(f90,plain,
( aElement0(xz)
& aElementOf0(xy,sdtpldt1(xI,xJ))
& xy = sdtpldt0(sK10,sK11)
& aElementOf0(sK11,xJ)
& aElementOf0(sK10,xI)
& aElementOf0(xx,sdtpldt1(xI,xJ))
& xx = sdtpldt0(sK12,sK13)
& aElementOf0(sK13,xJ)
& aElementOf0(sK12,xI) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13])],[f35,f89,f88]) ).
fof(f153,plain,
aElementOf0(sK10,xI),
inference(cnf_transformation,[],[f90]) ).
fof(f154,plain,
aElementOf0(sK11,xJ),
inference(cnf_transformation,[],[f90]) ).
fof(f155,plain,
xy = sdtpldt0(sK10,sK11),
inference(cnf_transformation,[],[f90]) ).
fof(f161,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) != xy
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_109,plain,
sdtpldt0(sK10,sK11) = xy,
inference(cnf_transformation,[],[f155]) ).
cnf(c_110,plain,
aElementOf0(sK11,xJ),
inference(cnf_transformation,[],[f154]) ).
cnf(c_111,plain,
aElementOf0(sK10,xI),
inference(cnf_transformation,[],[f153]) ).
cnf(c_119,negated_conjecture,
( sdtpldt0(X0,X1) != xy
| ~ aElementOf0(X0,xI)
| ~ aElementOf0(X1,xJ) ),
inference(cnf_transformation,[],[f161]) ).
cnf(c_3815,plain,
( ~ aElementOf0(sK10,xI)
| ~ aElementOf0(sK11,xJ) ),
inference(superposition,[status(thm)],[c_109,c_119]) ).
cnf(c_3816,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3815,c_110,c_111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG087+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n021.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:19:42 EDT 2023
% 0.13/0.35 % 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.84/1.17 % SZS status Started for theBenchmark.p
% 2.84/1.17 % SZS status Theorem for theBenchmark.p
% 2.84/1.17
% 2.84/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.84/1.17
% 2.84/1.17 ------ iProver source info
% 2.84/1.17
% 2.84/1.17 git: date: 2023-05-31 18:12:56 +0000
% 2.84/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.84/1.17 git: non_committed_changes: false
% 2.84/1.17 git: last_make_outside_of_git: false
% 2.84/1.17
% 2.84/1.17 ------ Parsing...
% 2.84/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.84/1.17
% 2.84/1.17 ------ 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
% 2.84/1.17
% 2.84/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.84/1.17
% 2.84/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.84/1.17 ------ Proving...
% 2.84/1.17 ------ Problem Properties
% 2.84/1.17
% 2.84/1.17
% 2.84/1.17 clauses 65
% 2.84/1.17 conjectures 1
% 2.84/1.17 EPR 14
% 2.84/1.17 Horn 56
% 2.84/1.17 unary 17
% 2.84/1.17 binary 12
% 2.84/1.17 lits 185
% 2.84/1.17 lits eq 35
% 2.84/1.17 fd_pure 0
% 2.84/1.17 fd_pseudo 0
% 2.84/1.17 fd_cond 1
% 2.84/1.17 fd_pseudo_cond 8
% 2.84/1.17 AC symbols 0
% 2.84/1.17
% 2.84/1.17 ------ Schedule dynamic 5 is on
% 2.84/1.17
% 2.84/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.84/1.17
% 2.84/1.17
% 2.84/1.17 ------
% 2.84/1.17 Current options:
% 2.84/1.17 ------
% 2.84/1.17
% 2.84/1.17
% 2.84/1.17
% 2.84/1.17
% 2.84/1.17 ------ Proving...
% 2.84/1.17
% 2.84/1.17
% 2.84/1.17 % SZS status Theorem for theBenchmark.p
% 2.84/1.17
% 2.84/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.84/1.17
% 2.84/1.17
%------------------------------------------------------------------------------