TSTP Solution File: RNG116+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG116+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:44 EDT 2024
% Result : Theorem 8.06s 1.65s
% Output : CNFRefutation 8.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 15 unt; 0 def)
% Number of atoms : 173 ( 57 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 209 ( 81 ~; 77 |; 43 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn 48 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,axiom,
! [X0] :
( aElement0(X0)
=> ! [X1] :
( slsdtgt0(X0) = X1
<=> ( ! [X2] :
( aElementOf0(X2,X1)
<=> ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) ) )
& aSet0(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(f39,axiom,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
fof(f47,axiom,
( xu = sdtpldt0(xk,xl)
& aElementOf0(xl,slsdtgt0(xb))
& aElementOf0(xk,slsdtgt0(xa)) ),
file('/export/starexec/sandbox2/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/sandbox2/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(f105,plain,
! [X0] :
( ! [X1] :
( slsdtgt0(X0) = X1
<=> ( ! [X2] :
( aElementOf0(X2,X1)
<=> ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) ) )
& aSet0(X1) ) )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f110,plain,
! [X0,X1] :
( xu != sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f156,plain,
! [X0] :
( ! [X1] :
( ( slsdtgt0(X0) = X1
| ? [X2] :
( ( ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) )
| ~ aElementOf0(X2,X1) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) )
| aElementOf0(X2,X1) ) )
| ~ aSet0(X1) )
& ( ( ! [X2] :
( ( aElementOf0(X2,X1)
| ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) ) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) )
| ~ aElementOf0(X2,X1) ) )
& aSet0(X1) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(nnf_transformation,[],[f105]) ).
fof(f157,plain,
! [X0] :
( ! [X1] :
( ( slsdtgt0(X0) = X1
| ? [X2] :
( ( ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) )
| ~ aElementOf0(X2,X1) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) )
| aElementOf0(X2,X1) ) )
| ~ aSet0(X1) )
& ( ( ! [X2] :
( ( aElementOf0(X2,X1)
| ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) ) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) )
| ~ aElementOf0(X2,X1) ) )
& aSet0(X1) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(flattening,[],[f156]) ).
fof(f158,plain,
! [X0] :
( ! [X1] :
( ( slsdtgt0(X0) = X1
| ? [X2] :
( ( ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) )
| ~ aElementOf0(X2,X1) )
& ( ? [X4] :
( sdtasdt0(X0,X4) = X2
& aElement0(X4) )
| aElementOf0(X2,X1) ) )
| ~ aSet0(X1) )
& ( ( ! [X5] :
( ( aElementOf0(X5,X1)
| ! [X6] :
( sdtasdt0(X0,X6) != X5
| ~ aElement0(X6) ) )
& ( ? [X7] :
( sdtasdt0(X0,X7) = X5
& aElement0(X7) )
| ~ aElementOf0(X5,X1) ) )
& aSet0(X1) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(rectify,[],[f157]) ).
fof(f159,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) )
| ~ aElementOf0(X2,X1) )
& ( ? [X4] :
( sdtasdt0(X0,X4) = X2
& aElement0(X4) )
| aElementOf0(X2,X1) ) )
=> ( ( ! [X3] :
( sdtasdt0(X0,X3) != sK19(X0,X1)
| ~ aElement0(X3) )
| ~ aElementOf0(sK19(X0,X1),X1) )
& ( ? [X4] :
( sdtasdt0(X0,X4) = sK19(X0,X1)
& aElement0(X4) )
| aElementOf0(sK19(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
! [X0,X1] :
( ? [X4] :
( sdtasdt0(X0,X4) = sK19(X0,X1)
& aElement0(X4) )
=> ( sK19(X0,X1) = sdtasdt0(X0,sK20(X0,X1))
& aElement0(sK20(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
! [X0,X5] :
( ? [X7] :
( sdtasdt0(X0,X7) = X5
& aElement0(X7) )
=> ( sdtasdt0(X0,sK21(X0,X5)) = X5
& aElement0(sK21(X0,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
! [X0] :
( ! [X1] :
( ( slsdtgt0(X0) = X1
| ( ( ! [X3] :
( sdtasdt0(X0,X3) != sK19(X0,X1)
| ~ aElement0(X3) )
| ~ aElementOf0(sK19(X0,X1),X1) )
& ( ( sK19(X0,X1) = sdtasdt0(X0,sK20(X0,X1))
& aElement0(sK20(X0,X1)) )
| aElementOf0(sK19(X0,X1),X1) ) )
| ~ aSet0(X1) )
& ( ( ! [X5] :
( ( aElementOf0(X5,X1)
| ! [X6] :
( sdtasdt0(X0,X6) != X5
| ~ aElement0(X6) ) )
& ( ( sdtasdt0(X0,sK21(X0,X5)) = X5
& aElement0(sK21(X0,X5)) )
| ~ aElementOf0(X5,X1) ) )
& aSet0(X1) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20,sK21])],[f158,f161,f160,f159]) ).
fof(f249,plain,
! [X0,X1,X5] :
( aElement0(sK21(X0,X5))
| ~ aElementOf0(X5,X1)
| slsdtgt0(X0) != X1
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f250,plain,
! [X0,X1,X5] :
( sdtasdt0(X0,sK21(X0,X5)) = X5
| ~ aElementOf0(X5,X1)
| slsdtgt0(X0) != X1
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f256,plain,
aElement0(xa),
inference(cnf_transformation,[],[f39]) ).
fof(f257,plain,
aElement0(xb),
inference(cnf_transformation,[],[f39]) ).
fof(f272,plain,
aElementOf0(xk,slsdtgt0(xa)),
inference(cnf_transformation,[],[f47]) ).
fof(f273,plain,
aElementOf0(xl,slsdtgt0(xb)),
inference(cnf_transformation,[],[f47]) ).
fof(f274,plain,
xu = sdtpldt0(xk,xl),
inference(cnf_transformation,[],[f47]) ).
fof(f275,plain,
! [X0,X1] :
( xu != sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1))
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f285,plain,
! [X0,X5] :
( sdtasdt0(X0,sK21(X0,X5)) = X5
| ~ aElementOf0(X5,slsdtgt0(X0))
| ~ aElement0(X0) ),
inference(equality_resolution,[],[f250]) ).
fof(f286,plain,
! [X0,X5] :
( aElement0(sK21(X0,X5))
| ~ aElementOf0(X5,slsdtgt0(X0))
| ~ aElement0(X0) ),
inference(equality_resolution,[],[f249]) ).
cnf(c_136,plain,
( ~ aElementOf0(X0,slsdtgt0(X1))
| ~ aElement0(X1)
| sdtasdt0(X1,sK21(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f285]) ).
cnf(c_137,plain,
( ~ aElementOf0(X0,slsdtgt0(X1))
| ~ aElement0(X1)
| aElement0(sK21(X1,X0)) ),
inference(cnf_transformation,[],[f286]) ).
cnf(c_140,plain,
aElement0(xb),
inference(cnf_transformation,[],[f257]) ).
cnf(c_141,plain,
aElement0(xa),
inference(cnf_transformation,[],[f256]) ).
cnf(c_156,plain,
sdtpldt0(xk,xl) = xu,
inference(cnf_transformation,[],[f274]) ).
cnf(c_157,plain,
aElementOf0(xl,slsdtgt0(xb)),
inference(cnf_transformation,[],[f273]) ).
cnf(c_158,plain,
aElementOf0(xk,slsdtgt0(xa)),
inference(cnf_transformation,[],[f272]) ).
cnf(c_159,negated_conjecture,
( sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1)) != xu
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f275]) ).
cnf(c_5420,negated_conjecture,
( sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1)) != xu
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(demodulation,[status(thm)],[c_159]) ).
cnf(c_7798,plain,
( ~ aElement0(xb)
| aElement0(sK21(xb,xl)) ),
inference(superposition,[status(thm)],[c_157,c_137]) ).
cnf(c_7799,plain,
( ~ aElement0(xa)
| aElement0(sK21(xa,xk)) ),
inference(superposition,[status(thm)],[c_158,c_137]) ).
cnf(c_7800,plain,
aElement0(sK21(xa,xk)),
inference(forward_subsumption_resolution,[status(thm)],[c_7799,c_141]) ).
cnf(c_7801,plain,
aElement0(sK21(xb,xl)),
inference(forward_subsumption_resolution,[status(thm)],[c_7798,c_140]) ).
cnf(c_8808,plain,
( ~ aElement0(xb)
| sdtasdt0(xb,sK21(xb,xl)) = xl ),
inference(superposition,[status(thm)],[c_157,c_136]) ).
cnf(c_8809,plain,
( ~ aElement0(xa)
| sdtasdt0(xa,sK21(xa,xk)) = xk ),
inference(superposition,[status(thm)],[c_158,c_136]) ).
cnf(c_8836,plain,
sdtasdt0(xa,sK21(xa,xk)) = xk,
inference(forward_subsumption_resolution,[status(thm)],[c_8809,c_141]) ).
cnf(c_8837,plain,
sdtasdt0(xb,sK21(xb,xl)) = xl,
inference(forward_subsumption_resolution,[status(thm)],[c_8808,c_140]) ).
cnf(c_16085,plain,
( sdtpldt0(xk,sdtasdt0(xb,X0)) != xu
| ~ aElement0(sK21(xa,xk))
| ~ aElement0(X0) ),
inference(superposition,[status(thm)],[c_8836,c_5420]) ).
cnf(c_16094,plain,
( sdtpldt0(xk,sdtasdt0(xb,X0)) != xu
| ~ aElement0(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_16085,c_7800]) ).
cnf(c_16149,plain,
( sdtpldt0(xk,xl) != xu
| ~ aElement0(sK21(xb,xl)) ),
inference(superposition,[status(thm)],[c_8837,c_16094]) ).
cnf(c_16157,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_16149,c_7801,c_156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : RNG116+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 21:15:40 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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
% 8.06/1.65 % SZS status Started for theBenchmark.p
% 8.06/1.65 % SZS status Theorem for theBenchmark.p
% 8.06/1.65
% 8.06/1.65 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.06/1.65
% 8.06/1.65 ------ iProver source info
% 8.06/1.65
% 8.06/1.65 git: date: 2024-05-02 19:28:25 +0000
% 8.06/1.65 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.06/1.65 git: non_committed_changes: false
% 8.06/1.65
% 8.06/1.65 ------ Parsing...
% 8.06/1.65 ------ Clausification by vclausify_rel & Parsing by iProver...
% 8.06/1.65
% 8.06/1.65 ------ 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
% 8.06/1.65
% 8.06/1.65 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.06/1.65
% 8.06/1.65 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.06/1.65 ------ Proving...
% 8.06/1.65 ------ Problem Properties
% 8.06/1.65
% 8.06/1.65
% 8.06/1.65 clauses 106
% 8.06/1.65 conjectures 1
% 8.06/1.65 EPR 22
% 8.06/1.65 Horn 82
% 8.06/1.65 unary 19
% 8.06/1.65 binary 17
% 8.06/1.65 lits 352
% 8.06/1.65 lits eq 52
% 8.06/1.65 fd_pure 0
% 8.06/1.65 fd_pseudo 0
% 8.06/1.65 fd_cond 5
% 8.06/1.65 fd_pseudo_cond 11
% 8.06/1.65 AC symbols 0
% 8.06/1.65
% 8.06/1.65 ------ Schedule dynamic 5 is on
% 8.06/1.65
% 8.06/1.65 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.06/1.65
% 8.06/1.65
% 8.06/1.65 ------
% 8.06/1.65 Current options:
% 8.06/1.65 ------
% 8.06/1.65
% 8.06/1.65
% 8.06/1.65
% 8.06/1.65
% 8.06/1.65 ------ Proving...
% 8.06/1.65
% 8.06/1.65
% 8.06/1.65 % SZS status Theorem for theBenchmark.p
% 8.06/1.65
% 8.06/1.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.06/1.65
% 8.06/1.65
%------------------------------------------------------------------------------