TSTP Solution File: NUN087+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUN087+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:20 EDT 2024
% Result : Theorem 3.97s 1.22s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 59 ( 19 unt; 0 def)
% Number of atoms : 168 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 184 ( 75 ~; 61 |; 44 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 108 ( 3 sgn 55 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( ~ id(X1,X0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f5,axiom,
! [X13] : id(X13,X13),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f6,axiom,
! [X14,X15] :
( id(X15,X14)
| ~ id(X14,X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f8,axiom,
! [X19,X20] :
( ( r1(X20)
& r1(X19) )
| ( ~ r1(X20)
& ~ r1(X19) )
| ~ id(X19,X20) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f11,axiom,
! [X31,X32,X33,X34,X35,X36] :
( ( r4(X34,X35,X36)
& r4(X31,X32,X33) )
| ( ~ r4(X34,X35,X36)
& ~ r4(X31,X32,X33) )
| ~ id(X33,X36)
| ~ id(X32,X35)
| ~ id(X31,X34) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(f16,axiom,
! [X56] :
? [X57] :
( ? [X59] :
( r1(X59)
& id(X57,X59) )
& ? [X58] :
( r4(X56,X58,X57)
& r1(X58) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5a) ).
fof(f19,conjecture,
? [X62] :
( ? [X46] :
( r1(X46)
& id(X62,X46) )
& ? [X45] :
( r4(X45,X45,X62)
& r1(X45) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerotimeszeroeqzero) ).
fof(f20,negated_conjecture,
~ ? [X62] :
( ? [X46] :
( r1(X46)
& id(X62,X46) )
& ? [X45] :
( r4(X45,X45,X62)
& r1(X45) ) ),
inference(negated_conjecture,[],[f19]) ).
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(f30,plain,
! [X0,X1,X2,X3,X4,X5] :
( ( r4(X3,X4,X5)
& r4(X0,X1,X2) )
| ( ~ r4(X3,X4,X5)
& ~ r4(X0,X1,X2) )
| ~ id(X2,X5)
| ~ id(X1,X4)
| ~ id(X0,X3) ),
inference(rectify,[],[f11]) ).
fof(f35,plain,
! [X0] :
? [X1] :
( ? [X2] :
( r1(X2)
& id(X1,X2) )
& ? [X3] :
( r4(X0,X3,X1)
& r1(X3) ) ),
inference(rectify,[],[f16]) ).
fof(f38,plain,
~ ? [X0] :
( ? [X1] :
( r1(X1)
& id(X0,X1) )
& ? [X2] :
( r4(X2,X2,X0)
& r1(X2) ) ),
inference(rectify,[],[f20]) ).
fof(f39,plain,
! [X0] :
( ! [X1] :
( ~ r1(X1)
| ~ id(X0,X1) )
| ! [X2] :
( ~ r4(X2,X2,X0)
| ~ r1(X2) ) ),
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(f61,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( r1(X2)
& id(X1,X2) )
& ? [X3] :
( r4(X0,X3,X1)
& r1(X3) ) )
=> ( ? [X2] :
( r1(X2)
& id(sK14(X0),X2) )
& ? [X3] :
( r4(X0,X3,sK14(X0))
& r1(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f62,plain,
! [X0] :
( ? [X2] :
( r1(X2)
& id(sK14(X0),X2) )
=> ( r1(sK15(X0))
& id(sK14(X0),sK15(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f63,plain,
! [X0] :
( ? [X3] :
( r4(X0,X3,sK14(X0))
& r1(X3) )
=> ( r4(X0,sK16(X0),sK14(X0))
& r1(sK16(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f64,plain,
! [X0] :
( r1(sK15(X0))
& id(sK14(X0),sK15(X0))
& r4(X0,sK16(X0),sK14(X0))
& r1(sK16(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15,sK16])],[f35,f63,f62,f61]) ).
fof(f68,plain,
! [X1] :
( ~ r1(X1)
| id(X1,sK0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f71,plain,
! [X1] :
( ~ id(X1,sK0)
| r1(X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f84,plain,
! [X0] : id(X0,X0),
inference(cnf_transformation,[],[f24]) ).
fof(f85,plain,
! [X0,X1] :
( id(X1,X0)
| ~ id(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f89,plain,
! [X0,X1] :
( r1(X1)
| ~ r1(X0)
| ~ id(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f101,plain,
! [X2,X3,X0,X1,X4,X5] :
( r4(X3,X4,X5)
| ~ r4(X0,X1,X2)
| ~ id(X2,X5)
| ~ id(X1,X4)
| ~ id(X0,X3) ),
inference(cnf_transformation,[],[f30]) ).
fof(f117,plain,
! [X0] : r1(sK16(X0)),
inference(cnf_transformation,[],[f64]) ).
fof(f118,plain,
! [X0] : r4(X0,sK16(X0),sK14(X0)),
inference(cnf_transformation,[],[f64]) ).
fof(f119,plain,
! [X0] : id(sK14(X0),sK15(X0)),
inference(cnf_transformation,[],[f64]) ).
fof(f120,plain,
! [X0] : r1(sK15(X0)),
inference(cnf_transformation,[],[f64]) ).
fof(f126,plain,
! [X2,X0,X1] :
( ~ r1(X1)
| ~ id(X0,X1)
| ~ r4(X2,X2,X0)
| ~ r1(X2) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_49,plain,
( ~ id(X0,sK0)
| r1(X0) ),
inference(cnf_transformation,[],[f71]) ).
cnf(c_50,plain,
( ~ r1(X0)
| id(X0,sK0) ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_57,plain,
id(X0,X0),
inference(cnf_transformation,[],[f84]) ).
cnf(c_58,plain,
( ~ id(X0,X1)
| id(X1,X0) ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_60,plain,
( ~ id(X0,X1)
| ~ r1(X0)
| r1(X1) ),
inference(cnf_transformation,[],[f89]) ).
cnf(c_66,plain,
( ~ r4(X0,X1,X2)
| ~ id(X0,X5)
| ~ id(X1,X3)
| ~ id(X2,X4)
| r4(X5,X3,X4) ),
inference(cnf_transformation,[],[f101]) ).
cnf(c_82,plain,
r1(sK15(X0)),
inference(cnf_transformation,[],[f120]) ).
cnf(c_83,plain,
id(sK14(X0),sK15(X0)),
inference(cnf_transformation,[],[f119]) ).
cnf(c_84,plain,
r4(X0,sK16(X0),sK14(X0)),
inference(cnf_transformation,[],[f118]) ).
cnf(c_85,plain,
r1(sK16(X0)),
inference(cnf_transformation,[],[f117]) ).
cnf(c_91,negated_conjecture,
( ~ r4(X0,X0,X1)
| ~ id(X1,X2)
| ~ r1(X0)
| ~ r1(X2) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_92,plain,
r1(sK16(sK0)),
inference(instantiation,[status(thm)],[c_85]) ).
cnf(c_95,plain,
id(sK0,sK0),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_100,plain,
r4(sK0,sK16(sK0),sK14(sK0)),
inference(instantiation,[status(thm)],[c_84]) ).
cnf(c_104,plain,
( ~ id(sK0,sK0)
| r1(sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_122,plain,
( ~ r4(sK0,sK0,sK0)
| ~ id(sK0,sK0)
| ~ r1(sK0) ),
inference(instantiation,[status(thm)],[c_91]) ).
cnf(c_487,plain,
( ~ r4(X0,sK16(X0),sK14(X0))
| ~ id(sK14(X0),X1)
| ~ id(sK16(X0),X2)
| ~ id(X0,X3)
| r4(X3,X2,X1) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_488,plain,
( ~ r4(sK0,sK16(sK0),sK14(sK0))
| ~ id(sK14(sK0),sK0)
| ~ id(sK16(sK0),sK0)
| ~ id(sK0,sK0)
| r4(sK0,sK0,sK0) ),
inference(instantiation,[status(thm)],[c_487]) ).
cnf(c_835,plain,
( ~ r1(sK14(X0))
| id(sK14(X0),sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_836,plain,
( ~ r1(sK14(sK0))
| id(sK14(sK0),sK0) ),
inference(instantiation,[status(thm)],[c_835]) ).
cnf(c_924,plain,
id(sK15(X0),sK14(X0)),
inference(superposition,[status(thm)],[c_83,c_58]) ).
cnf(c_1501,plain,
( ~ r1(sK15(X0))
| r1(sK14(X0)) ),
inference(superposition,[status(thm)],[c_924,c_60]) ).
cnf(c_1509,plain,
r1(sK14(X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_1501,c_82]) ).
cnf(c_1527,plain,
r1(sK14(sK0)),
inference(instantiation,[status(thm)],[c_1509]) ).
cnf(c_1885,plain,
( ~ r1(sK16(X0))
| id(sK16(X0),sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_1886,plain,
( ~ r1(sK16(sK0))
| id(sK16(sK0),sK0) ),
inference(instantiation,[status(thm)],[c_1885]) ).
cnf(c_1887,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1886,c_1527,c_836,c_488,c_122,c_104,c_100,c_95,c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUN087+1 : TPTP v8.1.2. Released v7.3.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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:39:19 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 3.97/1.22 % SZS status Started for theBenchmark.p
% 3.97/1.22 % SZS status Theorem for theBenchmark.p
% 3.97/1.22
% 3.97/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.97/1.22
% 3.97/1.22 ------ iProver source info
% 3.97/1.22
% 3.97/1.22 git: date: 2024-05-02 19:28:25 +0000
% 3.97/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.97/1.22 git: non_committed_changes: false
% 3.97/1.22
% 3.97/1.22 ------ Parsing...
% 3.97/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.97/1.22
% 3.97/1.22 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.97/1.22
% 3.97/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.97/1.22 ------ Proving...
% 3.97/1.22 ------ Problem Properties
% 3.97/1.22
% 3.97/1.22
% 3.97/1.22 clauses 43
% 3.97/1.22 conjectures 1
% 3.97/1.22 EPR 16
% 3.97/1.22 Horn 39
% 3.97/1.22 unary 18
% 3.97/1.22 binary 13
% 3.97/1.22 lits 92
% 3.97/1.22 lits eq 0
% 3.97/1.22 fd_pure 0
% 3.97/1.22 fd_pseudo 0
% 3.97/1.22 fd_cond 0
% 3.97/1.22 fd_pseudo_cond 0
% 3.97/1.22 AC symbols 0
% 3.97/1.22
% 3.97/1.22 ------ Schedule dynamic 5 is on
% 3.97/1.22
% 3.97/1.22 ------ no equalities: superposition off
% 3.97/1.22
% 3.97/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.97/1.22
% 3.97/1.22
% 3.97/1.22 ------
% 3.97/1.22 Current options:
% 3.97/1.22 ------
% 3.97/1.22
% 3.97/1.22
% 3.97/1.22
% 3.97/1.22
% 3.97/1.22 ------ Proving...
% 3.97/1.22
% 3.97/1.22
% 3.97/1.22 % SZS status Theorem for theBenchmark.p
% 3.97/1.22
% 3.97/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.97/1.22
% 3.97/1.23
%------------------------------------------------------------------------------