TSTP Solution File: NUN067+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUN067+1 : TPTP v8.1.2. Released v7.3.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:53:14 EDT 2024
% Result : Theorem 2.99s 1.17s
% Output : CNFRefutation 2.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 52 ( 16 unt; 0 def)
% Number of atoms : 125 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 138 ( 65 ~; 44 |; 26 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 81 ( 5 sgn 49 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( ~ id(X1,X0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f2,axiom,
! [X2] :
? [X3] :
! [X4] :
( ( ~ id(X4,X3)
& ~ r2(X2,X4) )
| ( r2(X2,X4)
& id(X4,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f5,axiom,
! [X13] : id(X13,X13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f6,axiom,
! [X14,X15] :
( id(X15,X14)
| ~ id(X14,X15) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f8,axiom,
! [X19,X20] :
( ( r1(X20)
& r1(X19) )
| ( ~ r1(X20)
& ~ r1(X19) )
| ~ id(X19,X20) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(f18,axiom,
! [X64,X65] :
( ~ r2(X64,X65)
| ! [X66] :
( ~ r1(X66)
| ~ id(X66,X65) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7a) ).
fof(f19,conjecture,
? [X62] :
! [X45] :
( ~ r1(X45)
| ~ id(X62,X45) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonzerosexistid) ).
fof(f20,negated_conjecture,
~ ? [X62] :
! [X45] :
( ~ r1(X45)
| ~ id(X62,X45) ),
inference(negated_conjecture,[],[f19]) ).
fof(f21,plain,
! [X0] :
? [X1] :
! [X2] :
( ( ~ id(X2,X1)
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,X1) ) ),
inference(rectify,[],[f2]) ).
fof(f24,plain,
! [X0] : id(X0,X0),
inference(rectify,[],[f5]) ).
fof(f25,plain,
! [X0,X1] :
( id(X1,X0)
| ~ id(X0,X1) ),
inference(rectify,[],[f6]) ).
fof(f27,plain,
! [X0,X1] :
( ( r1(X1)
& r1(X0) )
| ( ~ r1(X1)
& ~ r1(X0) )
| ~ id(X0,X1) ),
inference(rectify,[],[f8]) ).
fof(f37,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( ~ r1(X2)
| ~ id(X2,X1) ) ),
inference(rectify,[],[f18]) ).
fof(f38,plain,
~ ? [X0] :
! [X1] :
( ~ r1(X1)
| ~ id(X0,X1) ),
inference(rectify,[],[f20]) ).
fof(f39,plain,
! [X0] :
? [X1] :
( r1(X1)
& id(X0,X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f40,plain,
( ? [X0] :
! [X1] :
( ( ~ id(X1,X0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,X0) ) )
=> ! [X1] :
( ( ~ id(X1,sK0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X1] :
( ( ~ id(X1,sK0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f40]) ).
fof(f42,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( ~ id(X2,X1)
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,X1) ) )
=> ! [X2] :
( ( ~ id(X2,sK1(X0))
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,sK1(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
! [X0,X2] :
( ( ~ id(X2,sK1(X0))
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,sK1(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f21,f42]) ).
fof(f68,plain,
! [X0] :
( ? [X1] :
( r1(X1)
& id(X0,X1) )
=> ( r1(sK20(X0))
& id(X0,sK20(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
! [X0] :
( r1(sK20(X0))
& id(X0,sK20(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20])],[f39,f68]) ).
fof(f70,plain,
! [X1] :
( ~ r1(X1)
| id(X1,sK0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f73,plain,
! [X1] :
( ~ id(X1,sK0)
| r1(X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f77,plain,
! [X2,X0] :
( ~ id(X2,sK1(X0))
| r2(X0,X2) ),
inference(cnf_transformation,[],[f43]) ).
fof(f86,plain,
! [X0] : id(X0,X0),
inference(cnf_transformation,[],[f24]) ).
fof(f87,plain,
! [X0,X1] :
( id(X1,X0)
| ~ id(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f91,plain,
! [X0,X1] :
( r1(X1)
| ~ r1(X0)
| ~ id(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f127,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| ~ r1(X2)
| ~ id(X2,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f128,plain,
! [X0] : id(X0,sK20(X0)),
inference(cnf_transformation,[],[f69]) ).
fof(f129,plain,
! [X0] : r1(sK20(X0)),
inference(cnf_transformation,[],[f69]) ).
cnf(c_49,plain,
( ~ id(X0,sK0)
| r1(X0) ),
inference(cnf_transformation,[],[f73]) ).
cnf(c_50,plain,
( ~ r1(X0)
| id(X0,sK0) ),
inference(cnf_transformation,[],[f70]) ).
cnf(c_51,plain,
( ~ id(X0,sK1(X1))
| r2(X1,X0) ),
inference(cnf_transformation,[],[f77]) ).
cnf(c_57,plain,
id(X0,X0),
inference(cnf_transformation,[],[f86]) ).
cnf(c_58,plain,
( ~ id(X0,X1)
| id(X1,X0) ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_60,plain,
( ~ id(X0,X1)
| ~ r1(X0)
| r1(X1) ),
inference(cnf_transformation,[],[f91]) ).
cnf(c_90,plain,
( ~ id(X0,X1)
| ~ r2(X2,X1)
| ~ r1(X0) ),
inference(cnf_transformation,[],[f127]) ).
cnf(c_91,negated_conjecture,
r1(sK20(X0)),
inference(cnf_transformation,[],[f129]) ).
cnf(c_92,negated_conjecture,
id(X0,sK20(X0)),
inference(cnf_transformation,[],[f128]) ).
cnf(c_97,plain,
id(sK0,sK0),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_107,plain,
( ~ id(sK0,sK0)
| r1(sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_124,plain,
( ~ id(sK0,sK0)
| ~ r2(sK0,sK0)
| ~ r1(sK0) ),
inference(instantiation,[status(thm)],[c_90]) ).
cnf(c_417,negated_conjecture,
id(X0,sK20(X0)),
inference(demodulation,[status(thm)],[c_92]) ).
cnf(c_418,negated_conjecture,
r1(sK20(X0)),
inference(demodulation,[status(thm)],[c_91]) ).
cnf(c_861,plain,
( ~ r1(X0)
| id(sK0,X0) ),
inference(superposition,[status(thm)],[c_50,c_58]) ).
cnf(c_865,plain,
id(sK20(X0),X0),
inference(superposition,[status(thm)],[c_417,c_58]) ).
cnf(c_994,plain,
( ~ r1(sK1(X0))
| r2(X0,sK0) ),
inference(superposition,[status(thm)],[c_861,c_51]) ).
cnf(c_1320,plain,
( ~ r1(sK20(X0))
| r1(X0) ),
inference(superposition,[status(thm)],[c_865,c_60]) ).
cnf(c_1325,plain,
r1(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_1320,c_418]) ).
cnf(c_1326,plain,
r2(X0,sK0),
inference(backward_subsumption_resolution,[status(thm)],[c_994,c_1325]) ).
cnf(c_1329,plain,
r2(sK0,sK0),
inference(instantiation,[status(thm)],[c_1326]) ).
cnf(c_1330,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1329,c_124,c_107,c_97]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUN067+1 : TPTP v8.1.2. Released v7.3.0.
% 0.04/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 21:38:41 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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
% 2.99/1.17 % SZS status Started for theBenchmark.p
% 2.99/1.17 % SZS status Theorem for theBenchmark.p
% 2.99/1.17
% 2.99/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.99/1.17
% 2.99/1.17 ------ iProver source info
% 2.99/1.17
% 2.99/1.17 git: date: 2024-05-02 19:28:25 +0000
% 2.99/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.99/1.17 git: non_committed_changes: false
% 2.99/1.17
% 2.99/1.17 ------ Parsing...
% 2.99/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.99/1.17
% 2.99/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.99/1.17
% 2.99/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.99/1.17 ------ Proving...
% 2.99/1.17 ------ Problem Properties
% 2.99/1.17
% 2.99/1.17
% 2.99/1.17 clauses 44
% 2.99/1.17 conjectures 2
% 2.99/1.17 EPR 15
% 2.99/1.17 Horn 40
% 2.99/1.17 unary 20
% 2.99/1.17 binary 13
% 2.99/1.17 lits 90
% 2.99/1.17 lits eq 0
% 2.99/1.17 fd_pure 0
% 2.99/1.17 fd_pseudo 0
% 2.99/1.17 fd_cond 0
% 2.99/1.17 fd_pseudo_cond 0
% 2.99/1.17 AC symbols 0
% 2.99/1.17
% 2.99/1.17 ------ Schedule dynamic 5 is on
% 2.99/1.17
% 2.99/1.17 ------ no equalities: superposition off
% 2.99/1.17
% 2.99/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.99/1.17
% 2.99/1.17
% 2.99/1.17 ------
% 2.99/1.17 Current options:
% 2.99/1.17 ------
% 2.99/1.17
% 2.99/1.17
% 2.99/1.17
% 2.99/1.17
% 2.99/1.17 ------ Proving...
% 2.99/1.17
% 2.99/1.17
% 2.99/1.17 % SZS status Theorem for theBenchmark.p
% 2.99/1.17
% 2.99/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.99/1.17
% 2.99/1.17
%------------------------------------------------------------------------------