TSTP Solution File: NUN070+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUN070+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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 12:49:17 EDT 2023
% Result : Theorem 3.40s 1.15s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 15 unt; 0 def)
% Number of atoms : 157 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 167 ( 54 ~; 40 |; 66 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 119 ( 3 sgn; 44 !; 48 ?)
% 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(f13,axiom,
! [X43,X44] :
? [X45] :
( ? [X48] :
( r4(X43,X44,X48)
& r3(X48,X43,X45) )
& ? [X46] :
( ? [X47] :
( r4(X43,X47,X46)
& r2(X44,X47) )
& id(X46,X45) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2a) ).
fof(f15,axiom,
! [X53] :
? [X54] :
( ? [X55] :
( r3(X53,X55,X54)
& r1(X55) )
& id(X54,X53) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4a) ).
fof(f19,conjecture,
? [X62] :
( ? [X46] :
( ? [X48] :
( r2(X48,X46)
& r1(X48) )
& id(X62,X46) )
& ? [X45] :
( ? [X40] :
( r2(X40,X45)
& r1(X40) )
& ? [X39] :
( r3(X45,X39,X62)
& r1(X39) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',onepluszeroidone) ).
fof(f20,negated_conjecture,
~ ? [X62] :
( ? [X46] :
( ? [X48] :
( r2(X48,X46)
& r1(X48) )
& id(X62,X46) )
& ? [X45] :
( ? [X40] :
( r2(X40,X45)
& r1(X40) )
& ? [X39] :
( r3(X45,X39,X62)
& r1(X39) ) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f24,plain,
! [X0] : id(X0,X0),
inference(rectify,[],[f5]) ).
fof(f32,plain,
! [X0,X1] :
? [X2] :
( ? [X3] :
( r4(X0,X1,X3)
& r3(X3,X0,X2) )
& ? [X4] :
( ? [X5] :
( r4(X0,X5,X4)
& r2(X1,X5) )
& id(X4,X2) ) ),
inference(rectify,[],[f13]) ).
fof(f34,plain,
! [X0] :
? [X1] :
( ? [X2] :
( r3(X0,X2,X1)
& r1(X2) )
& id(X1,X0) ),
inference(rectify,[],[f15]) ).
fof(f38,plain,
~ ? [X0] :
( ? [X1] :
( ? [X2] :
( r2(X2,X1)
& r1(X2) )
& id(X0,X1) )
& ? [X3] :
( ? [X4] :
( r2(X4,X3)
& r1(X4) )
& ? [X5] :
( r3(X3,X5,X0)
& r1(X5) ) ) ),
inference(rectify,[],[f20]) ).
fof(f39,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ~ r2(X2,X1)
| ~ r1(X2) )
| ~ id(X0,X1) )
| ! [X3] :
( ! [X4] :
( ~ r2(X4,X3)
| ~ r1(X4) )
| ! [X5] :
( ~ r3(X3,X5,X0)
| ~ r1(X5) ) ) ),
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(f53,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( r4(X0,X1,X3)
& r3(X3,X0,X2) )
& ? [X4] :
( ? [X5] :
( r4(X0,X5,X4)
& r2(X1,X5) )
& id(X4,X2) ) )
=> ( ? [X3] :
( r4(X0,X1,X3)
& r3(X3,X0,sK8(X0,X1)) )
& ? [X4] :
( ? [X5] :
( r4(X0,X5,X4)
& r2(X1,X5) )
& id(X4,sK8(X0,X1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
! [X0,X1] :
( ? [X3] :
( r4(X0,X1,X3)
& r3(X3,X0,sK8(X0,X1)) )
=> ( r4(X0,X1,sK9(X0,X1))
& r3(sK9(X0,X1),X0,sK8(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( r4(X0,X5,X4)
& r2(X1,X5) )
& id(X4,sK8(X0,X1)) )
=> ( ? [X5] :
( r4(X0,X5,sK10(X0,X1))
& r2(X1,X5) )
& id(sK10(X0,X1),sK8(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
! [X0,X1] :
( ? [X5] :
( r4(X0,X5,sK10(X0,X1))
& r2(X1,X5) )
=> ( r4(X0,sK11(X0,X1),sK10(X0,X1))
& r2(X1,sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
! [X0,X1] :
( r4(X0,X1,sK9(X0,X1))
& r3(sK9(X0,X1),X0,sK8(X0,X1))
& r4(X0,sK11(X0,X1),sK10(X0,X1))
& r2(X1,sK11(X0,X1))
& id(sK10(X0,X1),sK8(X0,X1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11])],[f32,f56,f55,f54,f53]) ).
fof(f58,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( r3(X0,X2,X1)
& r1(X2) )
& id(X1,X0) )
=> ( ? [X2] :
( r3(X0,X2,sK12(X0))
& r1(X2) )
& id(sK12(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
! [X0] :
( ? [X2] :
( r3(X0,X2,sK12(X0))
& r1(X2) )
=> ( r3(X0,sK13(X0),sK12(X0))
& r1(sK13(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
! [X0] :
( r3(X0,sK13(X0),sK12(X0))
& r1(sK13(X0))
& id(sK12(X0),X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13])],[f34,f59,f58]) ).
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(f109,plain,
! [X0,X1] : r2(X1,sK11(X0,X1)),
inference(cnf_transformation,[],[f57]) ).
fof(f114,plain,
! [X0] : id(sK12(X0),X0),
inference(cnf_transformation,[],[f60]) ).
fof(f115,plain,
! [X0] : r1(sK13(X0)),
inference(cnf_transformation,[],[f60]) ).
fof(f116,plain,
! [X0] : r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f60]) ).
fof(f126,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ r2(X2,X1)
| ~ r1(X2)
| ~ id(X0,X1)
| ~ r2(X4,X3)
| ~ r1(X4)
| ~ r3(X3,X5,X0)
| ~ r1(X5) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_49,plain,
( ~ id(X0,sK0)
| r1(X0) ),
inference(cnf_transformation,[],[f71]) ).
cnf(c_57,plain,
id(X0,X0),
inference(cnf_transformation,[],[f84]) ).
cnf(c_76,plain,
r2(X0,sK11(X1,X0)),
inference(cnf_transformation,[],[f109]) ).
cnf(c_79,plain,
r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f116]) ).
cnf(c_80,plain,
r1(sK13(X0)),
inference(cnf_transformation,[],[f115]) ).
cnf(c_81,plain,
id(sK12(X0),X0),
inference(cnf_transformation,[],[f114]) ).
cnf(c_91,negated_conjecture,
( ~ r3(X0,X1,X2)
| ~ id(X2,X3)
| ~ r2(X4,X3)
| ~ r2(X5,X0)
| ~ r1(X1)
| ~ r1(X4)
| ~ r1(X5) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_95,plain,
id(sK0,sK0),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_98,plain,
r2(sK0,sK11(sK0,sK0)),
inference(instantiation,[status(thm)],[c_76]) ).
cnf(c_104,plain,
( ~ id(sK0,sK0)
| r1(sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_894,plain,
( ~ id(sK12(X0),X1)
| ~ r2(X2,X1)
| ~ r2(X3,X0)
| ~ r1(sK13(X0))
| ~ r1(X2)
| ~ r1(X3) ),
inference(superposition,[status(thm)],[c_79,c_91]) ).
cnf(c_895,plain,
( ~ id(sK12(X0),X1)
| ~ r2(X2,X1)
| ~ r2(X3,X0)
| ~ r1(X2)
| ~ r1(X3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_894,c_80]) ).
cnf(c_1000,plain,
( ~ r2(X0,X1)
| ~ r2(X2,X1)
| ~ r1(X0)
| ~ r1(X2) ),
inference(superposition,[status(thm)],[c_81,c_895]) ).
cnf(c_1127,plain,
( ~ r2(X0,sK11(X1,X2))
| ~ r1(X0)
| ~ r1(X2) ),
inference(superposition,[status(thm)],[c_76,c_1000]) ).
cnf(c_1134,plain,
( ~ r2(sK0,sK11(sK0,sK0))
| ~ r1(sK0) ),
inference(instantiation,[status(thm)],[c_1127]) ).
cnf(c_1135,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1134,c_104,c_98,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN070+1 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n026.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 10:05:34 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.40/1.15 % SZS status Started for theBenchmark.p
% 3.40/1.15 % SZS status Theorem for theBenchmark.p
% 3.40/1.15
% 3.40/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.40/1.15
% 3.40/1.15 ------ iProver source info
% 3.40/1.15
% 3.40/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.40/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.40/1.15 git: non_committed_changes: false
% 3.40/1.15 git: last_make_outside_of_git: false
% 3.40/1.15
% 3.40/1.15 ------ Parsing...
% 3.40/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.40/1.15
% 3.40/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.40/1.15
% 3.40/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.40/1.15 ------ Proving...
% 3.40/1.15 ------ Problem Properties
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 clauses 43
% 3.40/1.15 conjectures 1
% 3.40/1.15 EPR 16
% 3.40/1.15 Horn 39
% 3.40/1.15 unary 18
% 3.40/1.15 binary 13
% 3.40/1.15 lits 95
% 3.40/1.15 lits eq 0
% 3.40/1.15 fd_pure 0
% 3.40/1.15 fd_pseudo 0
% 3.40/1.15 fd_cond 0
% 3.40/1.15 fd_pseudo_cond 0
% 3.40/1.15 AC symbols 0
% 3.40/1.15
% 3.40/1.15 ------ Schedule dynamic 5 is on
% 3.40/1.15
% 3.40/1.15 ------ no equalities: superposition off
% 3.40/1.15
% 3.40/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 ------
% 3.40/1.15 Current options:
% 3.40/1.15 ------
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 ------ Proving...
% 3.40/1.15
% 3.40/1.15
% 3.40/1.15 % SZS status Theorem for theBenchmark.p
% 3.40/1.15
% 3.40/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.40/1.15
% 3.40/1.15
%------------------------------------------------------------------------------