TSTP Solution File: RNG086+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG086+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:34 EDT 2024
% Result : Theorem 3.47s 1.21s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 66 ( 18 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 62 ( 15 ~; 9 |; 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 : 24 ( 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(f27,conjecture,
? [X0,X1] :
( sdtpldt0(X0,X1) = xx
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f28,negated_conjecture,
~ ? [X0,X1] :
( sdtpldt0(X0,X1) = xx
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
inference(negated_conjecture,[],[f27]) ).
fof(f34,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(f67,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) != xx
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(ennf_transformation,[],[f28]) ).
fof(f87,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(f88,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(f89,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])],[f34,f88,f87]) ).
fof(f148,plain,
aElementOf0(sK12,xI),
inference(cnf_transformation,[],[f89]) ).
fof(f149,plain,
aElementOf0(sK13,xJ),
inference(cnf_transformation,[],[f89]) ).
fof(f150,plain,
xx = sdtpldt0(sK12,sK13),
inference(cnf_transformation,[],[f89]) ).
fof(f157,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) != xx
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(cnf_transformation,[],[f67]) ).
cnf(c_113,plain,
sdtpldt0(sK12,sK13) = xx,
inference(cnf_transformation,[],[f150]) ).
cnf(c_114,plain,
aElementOf0(sK13,xJ),
inference(cnf_transformation,[],[f149]) ).
cnf(c_115,plain,
aElementOf0(sK12,xI),
inference(cnf_transformation,[],[f148]) ).
cnf(c_116,negated_conjecture,
( sdtpldt0(X0,X1) != xx
| ~ aElementOf0(X0,xI)
| ~ aElementOf0(X1,xJ) ),
inference(cnf_transformation,[],[f157]) ).
cnf(c_2926,negated_conjecture,
( sdtpldt0(X0,X1) != xx
| ~ aElementOf0(X0,xI)
| ~ aElementOf0(X1,xJ) ),
inference(demodulation,[status(thm)],[c_116]) ).
cnf(c_3795,plain,
( ~ aElementOf0(sK12,xI)
| ~ aElementOf0(sK13,xJ) ),
inference(superposition,[status(thm)],[c_113,c_2926]) ).
cnf(c_3796,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3795,c_114,c_115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : RNG086+2 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n027.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 : Thu May 2 21:46:20 EDT 2024
% 0.13/0.34 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.47/1.21 % SZS status Started for theBenchmark.p
% 3.47/1.21 % SZS status Theorem for theBenchmark.p
% 3.47/1.21
% 3.47/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.47/1.21
% 3.47/1.21 ------ iProver source info
% 3.47/1.21
% 3.47/1.21 git: date: 2024-05-02 19:28:25 +0000
% 3.47/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.47/1.21 git: non_committed_changes: false
% 3.47/1.21
% 3.47/1.21 ------ Parsing...
% 3.47/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.47/1.21
% 3.47/1.21 ------ 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.47/1.21
% 3.47/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.47/1.21
% 3.47/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.47/1.21 ------ Proving...
% 3.47/1.21 ------ Problem Properties
% 3.47/1.21
% 3.47/1.21
% 3.47/1.21 clauses 62
% 3.47/1.21 conjectures 1
% 3.47/1.21 EPR 12
% 3.47/1.21 Horn 53
% 3.47/1.21 unary 14
% 3.47/1.21 binary 12
% 3.47/1.21 lits 182
% 3.47/1.21 lits eq 34
% 3.47/1.21 fd_pure 0
% 3.47/1.21 fd_pseudo 0
% 3.47/1.21 fd_cond 1
% 3.47/1.21 fd_pseudo_cond 8
% 3.47/1.21 AC symbols 0
% 3.47/1.21
% 3.47/1.21 ------ Schedule dynamic 5 is on
% 3.47/1.21
% 3.47/1.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.47/1.21
% 3.47/1.21
% 3.47/1.21 ------
% 3.47/1.21 Current options:
% 3.47/1.21 ------
% 3.47/1.21
% 3.47/1.21
% 3.47/1.21
% 3.47/1.21
% 3.47/1.21 ------ Proving...
% 3.47/1.21
% 3.47/1.21
% 3.47/1.21 % SZS status Theorem for theBenchmark.p
% 3.47/1.21
% 3.47/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.47/1.21
% 3.47/1.21
%------------------------------------------------------------------------------