TSTP Solution File: RNG095+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG095+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:37 EDT 2024
% Result : Theorem 3.78s 1.23s
% Output : CNFRefutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 62 ( 14 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 64 ( 27 ~; 18 |; 17 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 11 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(f29,axiom,
! [X0] :
( aElement0(X0)
=> ( aElementOf0(X0,sdtpldt1(xI,xJ))
& ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1205_03) ).
fof(f31,conjecture,
? [X0,X1] :
( sz10 = sdtpldt0(X0,X1)
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f32,negated_conjecture,
~ ? [X0,X1] :
( sz10 = sdtpldt0(X0,X1)
& aElementOf0(X1,xJ)
& aElementOf0(X0,xI) ),
inference(negated_conjecture,[],[f31]) ).
fof(f75,plain,
! [X0] :
( ( aElementOf0(X0,sdtpldt1(xI,xJ))
& ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) ) )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f76,plain,
! [X0,X1] :
( sz10 != sdtpldt0(X0,X1)
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(ennf_transformation,[],[f32]) ).
fof(f104,plain,
! [X0] :
( ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) )
=> ( sdtpldt0(sK13(X0),sK14(X0)) = X0
& aElementOf0(sK14(X0),xJ)
& aElementOf0(sK13(X0),xI) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
! [X0] :
( ( aElementOf0(X0,sdtpldt1(xI,xJ))
& sdtpldt0(sK13(X0),sK14(X0)) = X0
& aElementOf0(sK14(X0),xJ)
& aElementOf0(sK13(X0),xI) )
| ~ aElement0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f75,f104]) ).
fof(f107,plain,
aElement0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f173,plain,
! [X0] :
( aElementOf0(sK13(X0),xI)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f174,plain,
! [X0] :
( aElementOf0(sK14(X0),xJ)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f175,plain,
! [X0] :
( sdtpldt0(sK13(X0),sK14(X0)) = X0
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f179,plain,
! [X0,X1] :
( sz10 != sdtpldt0(X0,X1)
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(cnf_transformation,[],[f76]) ).
cnf(c_50,plain,
aElement0(sz10),
inference(cnf_transformation,[],[f107]) ).
cnf(c_117,plain,
( ~ aElement0(X0)
| sdtpldt0(sK13(X0),sK14(X0)) = X0 ),
inference(cnf_transformation,[],[f175]) ).
cnf(c_118,plain,
( ~ aElement0(X0)
| aElementOf0(sK14(X0),xJ) ),
inference(cnf_transformation,[],[f174]) ).
cnf(c_119,plain,
( ~ aElement0(X0)
| aElementOf0(sK13(X0),xI) ),
inference(cnf_transformation,[],[f173]) ).
cnf(c_122,negated_conjecture,
( sdtpldt0(X0,X1) != sz10
| ~ aElementOf0(X0,xI)
| ~ aElementOf0(X1,xJ) ),
inference(cnf_transformation,[],[f179]) ).
cnf(c_3256,negated_conjecture,
( sdtpldt0(X0,X1) != sz10
| ~ aElementOf0(X0,xI)
| ~ aElementOf0(X1,xJ) ),
inference(demodulation,[status(thm)],[c_122]) ).
cnf(c_5063,plain,
sdtpldt0(sK13(sz10),sK14(sz10)) = sz10,
inference(superposition,[status(thm)],[c_50,c_117]) ).
cnf(c_5504,plain,
( ~ aElementOf0(sK13(sz10),xI)
| ~ aElementOf0(sK14(sz10),xJ) ),
inference(superposition,[status(thm)],[c_5063,c_3256]) ).
cnf(c_5518,plain,
( ~ aElementOf0(sK13(sz10),xI)
| ~ aElement0(sz10) ),
inference(superposition,[status(thm)],[c_118,c_5504]) ).
cnf(c_5519,plain,
~ aElementOf0(sK13(sz10),xI),
inference(forward_subsumption_resolution,[status(thm)],[c_5518,c_50]) ).
cnf(c_5653,plain,
~ aElement0(sz10),
inference(superposition,[status(thm)],[c_119,c_5519]) ).
cnf(c_5654,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5653,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG095+2 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu May 2 21:40:18 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.78/1.23 % SZS status Started for theBenchmark.p
% 3.78/1.23 % SZS status Theorem for theBenchmark.p
% 3.78/1.23
% 3.78/1.23 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.78/1.23
% 3.78/1.23 ------ iProver source info
% 3.78/1.23
% 3.78/1.23 git: date: 2024-05-02 19:28:25 +0000
% 3.78/1.23 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.78/1.23 git: non_committed_changes: false
% 3.78/1.23
% 3.78/1.23 ------ Parsing...
% 3.78/1.23 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.78/1.23
% 3.78/1.23 ------ 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: 1 0s sf_e pe_s pe_e
% 3.78/1.23
% 3.78/1.23 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.78/1.23
% 3.78/1.23 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.78/1.23 ------ Proving...
% 3.78/1.23 ------ Problem Properties
% 3.78/1.23
% 3.78/1.23
% 3.78/1.23 clauses 71
% 3.78/1.23 conjectures 1
% 3.78/1.23 EPR 12
% 3.78/1.23 Horn 58
% 3.78/1.23 unary 9
% 3.78/1.23 binary 17
% 3.78/1.23 lits 220
% 3.78/1.23 lits eq 33
% 3.78/1.23 fd_pure 0
% 3.78/1.23 fd_pseudo 0
% 3.78/1.23 fd_cond 1
% 3.78/1.23 fd_pseudo_cond 8
% 3.78/1.23 AC symbols 0
% 3.78/1.23
% 3.78/1.23 ------ Schedule dynamic 5 is on
% 3.78/1.23
% 3.78/1.23 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.78/1.23
% 3.78/1.23
% 3.78/1.23 ------
% 3.78/1.23 Current options:
% 3.78/1.23 ------
% 3.78/1.23
% 3.78/1.23
% 3.78/1.23
% 3.78/1.23
% 3.78/1.23 ------ Proving...
% 3.78/1.23
% 3.78/1.23
% 3.78/1.23 % SZS status Theorem for theBenchmark.p
% 3.78/1.23
% 3.78/1.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.78/1.23
% 3.78/1.23
%------------------------------------------------------------------------------