TSTP Solution File: RNG124+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG124+1 : 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 : Thu Aug 31 13:55:27 EDT 2023
% Result : Theorem 3.26s 1.17s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 40 ( 16 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 40 ( 17 ~; 12 |; 10 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn; 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f45,axiom,
( ! [X0] :
( ( sz00 != X0
& aElementOf0(X0,xI) )
=> ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) )
& sz00 != xu
& aElementOf0(xu,xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(f50,axiom,
( ( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
| sz00 = xr )
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& aElement0(xr)
& aElement0(xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2666) ).
fof(f51,axiom,
sz00 != xr,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2673) ).
fof(f55,axiom,
aElementOf0(xr,xI),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2729) ).
fof(f116,plain,
( ! [X0] :
( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
| sz00 = X0
| ~ aElementOf0(X0,xI) )
& sz00 != xu
& aElementOf0(xu,xI) ),
inference(ennf_transformation,[],[f45]) ).
fof(f117,plain,
( ! [X0] :
( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
| sz00 = X0
| ~ aElementOf0(X0,xI) )
& sz00 != xu
& aElementOf0(xu,xI) ),
inference(flattening,[],[f116]) ).
fof(f280,plain,
! [X0] :
( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
| sz00 = X0
| ~ aElementOf0(X0,xI) ),
inference(cnf_transformation,[],[f117]) ).
fof(f290,plain,
( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
| sz00 = xr ),
inference(cnf_transformation,[],[f50]) ).
fof(f291,plain,
sz00 != xr,
inference(cnf_transformation,[],[f51]) ).
fof(f295,plain,
aElementOf0(xr,xI),
inference(cnf_transformation,[],[f55]) ).
cnf(c_152,plain,
( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
| ~ aElementOf0(X0,xI)
| X0 = sz00 ),
inference(cnf_transformation,[],[f280]) ).
cnf(c_161,plain,
( sz00 = xr
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ),
inference(cnf_transformation,[],[f290]) ).
cnf(c_165,plain,
sz00 != xr,
inference(cnf_transformation,[],[f291]) ).
cnf(c_169,plain,
aElementOf0(xr,xI),
inference(cnf_transformation,[],[f295]) ).
cnf(c_249,plain,
iLess0(sbrdtbr0(xr),sbrdtbr0(xu)),
inference(global_subsumption_just,[status(thm)],[c_161,c_165,c_161]) ).
cnf(c_8693,plain,
( ~ aElementOf0(xr,xI)
| sz00 = xr ),
inference(superposition,[status(thm)],[c_249,c_152]) ).
cnf(c_8694,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_8693,c_165,c_169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG124+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n028.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 : Sun Aug 27 03:14:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.26/1.17 % SZS status Started for theBenchmark.p
% 3.26/1.17 % SZS status Theorem for theBenchmark.p
% 3.26/1.17
% 3.26/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.26/1.17
% 3.26/1.17 ------ iProver source info
% 3.26/1.17
% 3.26/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.26/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.26/1.17 git: non_committed_changes: false
% 3.26/1.17 git: last_make_outside_of_git: false
% 3.26/1.17
% 3.26/1.17 ------ Parsing...
% 3.26/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.26/1.17
% 3.26/1.17 ------ 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
% 3.26/1.17
% 3.26/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.26/1.17
% 3.26/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.26/1.17 ------ Proving...
% 3.26/1.17 ------ Problem Properties
% 3.26/1.17
% 3.26/1.17
% 3.26/1.17 clauses 116
% 3.26/1.17 conjectures 0
% 3.26/1.17 EPR 31
% 3.26/1.17 Horn 92
% 3.26/1.17 unary 31
% 3.26/1.17 binary 16
% 3.26/1.17 lits 359
% 3.26/1.17 lits eq 54
% 3.26/1.17 fd_pure 0
% 3.26/1.17 fd_pseudo 0
% 3.26/1.17 fd_cond 5
% 3.26/1.17 fd_pseudo_cond 11
% 3.26/1.17 AC symbols 0
% 3.26/1.17
% 3.26/1.17 ------ Schedule dynamic 5 is on
% 3.26/1.17
% 3.26/1.17 ------ no conjectures: strip conj schedule
% 3.26/1.17
% 3.26/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.26/1.17
% 3.26/1.17
% 3.26/1.17 ------
% 3.26/1.17 Current options:
% 3.26/1.17 ------
% 3.26/1.17
% 3.26/1.17
% 3.26/1.17
% 3.26/1.17
% 3.26/1.17 ------ Proving...
% 3.26/1.17
% 3.26/1.17
% 3.26/1.17 % SZS status Theorem for theBenchmark.p
% 3.26/1.17
% 3.26/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.26/1.17
% 3.26/1.17
%------------------------------------------------------------------------------