TSTP Solution File: RNG116+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG116+4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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 : Mon Jun 24 14:04:27 EDT 2024
% Result : Theorem 0.45s 1.16s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 65 ( 28 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 60 ( 20 ~; 12 |; 26 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 4 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
( xu = sdtpldt0(xk,xl)
& aElementOf0(xl,slsdtgt0(xb))
& ? [X0] :
( sdtasdt0(xb,X0) = xl
& aElement0(X0) )
& aElementOf0(xk,slsdtgt0(xa))
& ? [X0] :
( sdtasdt0(xa,X0) = xk
& aElement0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2456) ).
fof(f48,conjecture,
? [X0,X1] :
( xu = sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
& aElement0(X1)
& aElement0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f49,negated_conjecture,
~ ? [X0,X1] :
( xu = sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
& aElement0(X1)
& aElement0(X0) ),
inference(negated_conjecture,[],[f48]) ).
fof(f63,plain,
( xu = sdtpldt0(xk,xl)
& aElementOf0(xl,slsdtgt0(xb))
& ? [X0] :
( sdtasdt0(xb,X0) = xl
& aElement0(X0) )
& aElementOf0(xk,slsdtgt0(xa))
& ? [X1] :
( sdtasdt0(xa,X1) = xk
& aElement0(X1) ) ),
inference(rectify,[],[f47]) ).
fof(f120,plain,
! [X0,X1] :
( xu != sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f208,plain,
( ? [X0] :
( sdtasdt0(xb,X0) = xl
& aElement0(X0) )
=> ( xl = sdtasdt0(xb,sK43)
& aElement0(sK43) ) ),
introduced(choice_axiom,[]) ).
fof(f209,plain,
( ? [X1] :
( sdtasdt0(xa,X1) = xk
& aElement0(X1) )
=> ( xk = sdtasdt0(xa,sK44)
& aElement0(sK44) ) ),
introduced(choice_axiom,[]) ).
fof(f210,plain,
( xu = sdtpldt0(xk,xl)
& aElementOf0(xl,slsdtgt0(xb))
& xl = sdtasdt0(xb,sK43)
& aElement0(sK43)
& aElementOf0(xk,slsdtgt0(xa))
& xk = sdtasdt0(xa,sK44)
& aElement0(sK44) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK43,sK44])],[f63,f209,f208]) ).
fof(f376,plain,
aElement0(sK44),
inference(cnf_transformation,[],[f210]) ).
fof(f377,plain,
xk = sdtasdt0(xa,sK44),
inference(cnf_transformation,[],[f210]) ).
fof(f379,plain,
aElement0(sK43),
inference(cnf_transformation,[],[f210]) ).
fof(f380,plain,
xl = sdtasdt0(xb,sK43),
inference(cnf_transformation,[],[f210]) ).
fof(f382,plain,
xu = sdtpldt0(xk,xl),
inference(cnf_transformation,[],[f210]) ).
fof(f383,plain,
! [X0,X1] :
( xu != sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f120]) ).
cnf(c_214,plain,
sdtpldt0(xk,xl) = xu,
inference(cnf_transformation,[],[f382]) ).
cnf(c_216,plain,
sdtasdt0(xb,sK43) = xl,
inference(cnf_transformation,[],[f380]) ).
cnf(c_217,plain,
aElement0(sK43),
inference(cnf_transformation,[],[f379]) ).
cnf(c_219,plain,
sdtasdt0(xa,sK44) = xk,
inference(cnf_transformation,[],[f377]) ).
cnf(c_220,plain,
aElement0(sK44),
inference(cnf_transformation,[],[f376]) ).
cnf(c_221,negated_conjecture,
( sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1)) != xu
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f383]) ).
cnf(c_7960,negated_conjecture,
( sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1)) != xu
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(demodulation,[status(thm)],[c_221]) ).
cnf(c_10112,plain,
( sdtpldt0(sdtasdt0(xa,X0),xl) != xu
| ~ aElement0(X0)
| ~ aElement0(sK43) ),
inference(superposition,[status(thm)],[c_216,c_7960]) ).
cnf(c_10115,plain,
( sdtpldt0(sdtasdt0(xa,X0),xl) != xu
| ~ aElement0(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_10112,c_217]) ).
cnf(c_10143,plain,
( sdtpldt0(xk,xl) != xu
| ~ aElement0(sK44) ),
inference(superposition,[status(thm)],[c_219,c_10115]) ).
cnf(c_10144,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10143,c_220,c_214]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG116+4 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jun 18 14:04:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/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
% 0.45/1.16 % SZS status Started for theBenchmark.p
% 0.45/1.16 % SZS status Theorem for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.45/1.16
% 0.45/1.16 ------ iProver source info
% 0.45/1.16
% 0.45/1.16 git: date: 2024-06-12 09:56:46 +0000
% 0.45/1.16 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.45/1.16 git: non_committed_changes: false
% 0.45/1.16
% 0.45/1.16 ------ Parsing...
% 0.45/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... sup_sim: 1 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
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.16 ------ Proving...
% 0.45/1.16 ------ Problem Properties
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 clauses 165
% 0.45/1.16 conjectures 1
% 0.45/1.16 EPR 44
% 0.45/1.16 Horn 138
% 0.45/1.16 unary 47
% 0.45/1.16 binary 36
% 0.45/1.16 lits 456
% 0.45/1.16 lits eq 73
% 0.45/1.16 fd_pure 0
% 0.45/1.16 fd_pseudo 0
% 0.45/1.16 fd_cond 5
% 0.45/1.16 fd_pseudo_cond 11
% 0.45/1.16 AC symbols 0
% 0.45/1.16
% 0.45/1.16 ------ Schedule dynamic 5 is on
% 0.45/1.16
% 0.45/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------
% 0.45/1.16 Current options:
% 0.45/1.16 ------
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------ Proving...
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 % SZS status Theorem for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.16
% 0.45/1.16
%------------------------------------------------------------------------------