TSTP Solution File: NUN059+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUN059+2 : TPTP v8.1.2. Bugfixed v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:12 EDT 2023
% Result : Theorem 2.69s 1.14s
% Output : CNFRefutation 2.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 25 unt; 0 def)
% Number of atoms : 152 ( 44 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 144 ( 47 ~; 29 |; 61 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 139 ( 7 sgn; 62 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( X0 = X1
& r1(X1) )
| ( X0 != X1
& ~ r1(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f4,axiom,
! [X9,X10] :
? [X11] :
! [X12] :
( ( X11 = X12
& r4(X9,X10,X12) )
| ( X11 != X12
& ~ r4(X9,X10,X12) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f8,axiom,
! [X29] :
? [X30] :
( X29 = X30
& ? [X31] :
( r3(X29,X31,X30)
& r1(X31) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4a) ).
fof(f9,axiom,
! [X32] :
? [X33] :
( ? [X35] :
( X33 = X35
& r1(X35) )
& ? [X34] :
( r4(X32,X34,X33)
& r1(X34) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5a) ).
fof(f12,conjecture,
? [X38,X22,X21,X15] :
( ? [X24] :
( ? [X18] :
( r3(X18,X24,X15)
& r4(X38,X38,X18) )
& r4(X22,X22,X24) )
& ? [X16] :
( X15 = X16
& r4(X21,X21,X16) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fermattothepoweroftwo) ).
fof(f13,negated_conjecture,
~ ? [X38,X22,X21,X15] :
( ? [X24] :
( ? [X18] :
( r3(X18,X24,X15)
& r4(X38,X38,X18) )
& r4(X22,X22,X24) )
& ? [X16] :
( X15 = X16
& r4(X21,X21,X16) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f16,plain,
! [X0,X1] :
? [X2] :
! [X3] :
( ( X2 = X3
& r4(X0,X1,X3) )
| ( X2 != X3
& ~ r4(X0,X1,X3) ) ),
inference(rectify,[],[f4]) ).
fof(f20,plain,
! [X0] :
? [X1] :
( X0 = X1
& ? [X2] :
( r3(X0,X2,X1)
& r1(X2) ) ),
inference(rectify,[],[f8]) ).
fof(f21,plain,
! [X0] :
? [X1] :
( ? [X2] :
( X1 = X2
& r1(X2) )
& ? [X3] :
( r4(X0,X3,X1)
& r1(X3) ) ),
inference(rectify,[],[f9]) ).
fof(f24,plain,
~ ? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5] :
( r3(X5,X4,X3)
& r4(X0,X0,X5) )
& r4(X1,X1,X4) )
& ? [X6] :
( X3 = X6
& r4(X2,X2,X6) ) ),
inference(rectify,[],[f13]) ).
fof(f25,plain,
! [X0,X1,X2,X3] :
( ! [X4] :
( ! [X5] :
( ~ r3(X5,X4,X3)
| ~ r4(X0,X0,X5) )
| ~ r4(X1,X1,X4) )
| ! [X6] :
( X3 != X6
| ~ r4(X2,X2,X6) ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f26,plain,
( ? [X0] :
! [X1] :
( ( X0 = X1
& r1(X1) )
| ( X0 != X1
& ~ r1(X1) ) )
=> ! [X1] :
( ( sK0 = X1
& r1(X1) )
| ( sK0 != X1
& ~ r1(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X1] :
( ( sK0 = X1
& r1(X1) )
| ( sK0 != X1
& ~ r1(X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f26]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X2] :
! [X3] :
( ( X2 = X3
& r4(X0,X1,X3) )
| ( X2 != X3
& ~ r4(X0,X1,X3) ) )
=> ! [X3] :
( ( sK3(X0,X1) = X3
& r4(X0,X1,X3) )
| ( sK3(X0,X1) != X3
& ~ r4(X0,X1,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1,X3] :
( ( sK3(X0,X1) = X3
& r4(X0,X1,X3) )
| ( sK3(X0,X1) != X3
& ~ r4(X0,X1,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f16,f32]) ).
fof(f44,plain,
! [X0] :
( ? [X1] :
( X0 = X1
& ? [X2] :
( r3(X0,X2,X1)
& r1(X2) ) )
=> ( sK12(X0) = X0
& ? [X2] :
( r3(X0,X2,sK12(X0))
& r1(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
! [X0] :
( ? [X2] :
( r3(X0,X2,sK12(X0))
& r1(X2) )
=> ( r3(X0,sK13(X0),sK12(X0))
& r1(sK13(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
! [X0] :
( sK12(X0) = X0
& r3(X0,sK13(X0),sK12(X0))
& r1(sK13(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13])],[f20,f45,f44]) ).
fof(f47,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( X1 = X2
& r1(X2) )
& ? [X3] :
( r4(X0,X3,X1)
& r1(X3) ) )
=> ( ? [X2] :
( sK14(X0) = X2
& r1(X2) )
& ? [X3] :
( r4(X0,X3,sK14(X0))
& r1(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f48,plain,
! [X0] :
( ? [X2] :
( sK14(X0) = X2
& r1(X2) )
=> ( sK14(X0) = sK15(X0)
& r1(sK15(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f49,plain,
! [X0] :
( ? [X3] :
( r4(X0,X3,sK14(X0))
& r1(X3) )
=> ( r4(X0,sK16(X0),sK14(X0))
& r1(sK16(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
! [X0] :
( sK14(X0) = sK15(X0)
& r1(sK15(X0))
& r4(X0,sK16(X0),sK14(X0))
& r1(sK16(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15,sK16])],[f21,f49,f48,f47]) ).
fof(f56,plain,
! [X1] :
( sK0 = X1
| ~ r1(X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f67,plain,
! [X3,X0,X1] :
( r4(X0,X1,X3)
| sK3(X0,X1) != X3 ),
inference(cnf_transformation,[],[f33]) ).
fof(f81,plain,
! [X0] : r1(sK13(X0)),
inference(cnf_transformation,[],[f46]) ).
fof(f82,plain,
! [X0] : r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f46]) ).
fof(f83,plain,
! [X0] : sK12(X0) = X0,
inference(cnf_transformation,[],[f46]) ).
fof(f84,plain,
! [X0] : r1(sK16(X0)),
inference(cnf_transformation,[],[f50]) ).
fof(f85,plain,
! [X0] : r4(X0,sK16(X0),sK14(X0)),
inference(cnf_transformation,[],[f50]) ).
fof(f86,plain,
! [X0] : r1(sK15(X0)),
inference(cnf_transformation,[],[f50]) ).
fof(f87,plain,
! [X0] : sK14(X0) = sK15(X0),
inference(cnf_transformation,[],[f50]) ).
fof(f93,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ r3(X5,X4,X3)
| ~ r4(X0,X0,X5)
| ~ r4(X1,X1,X4)
| X3 != X6
| ~ r4(X2,X2,X6) ),
inference(cnf_transformation,[],[f25]) ).
fof(f96,plain,
! [X0] : r4(X0,sK16(X0),sK15(X0)),
inference(definition_unfolding,[],[f85,f87]) ).
fof(f104,plain,
! [X0,X1] : r4(X0,X1,sK3(X0,X1)),
inference(equality_resolution,[],[f67]) ).
fof(f107,plain,
! [X2,X0,X1,X6,X4,X5] :
( ~ r3(X5,X4,X6)
| ~ r4(X0,X0,X5)
| ~ r4(X1,X1,X4)
| ~ r4(X2,X2,X6) ),
inference(equality_resolution,[],[f93]) ).
cnf(c_49,plain,
( ~ r1(X0)
| X0 = sK0 ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_56,plain,
r4(X0,X1,sK3(X0,X1)),
inference(cnf_transformation,[],[f104]) ).
cnf(c_66,plain,
sK12(X0) = X0,
inference(cnf_transformation,[],[f83]) ).
cnf(c_67,plain,
r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f82]) ).
cnf(c_68,plain,
r1(sK13(X0)),
inference(cnf_transformation,[],[f81]) ).
cnf(c_69,plain,
r1(sK15(X0)),
inference(cnf_transformation,[],[f86]) ).
cnf(c_70,plain,
r4(X0,sK16(X0),sK15(X0)),
inference(cnf_transformation,[],[f96]) ).
cnf(c_71,plain,
r1(sK16(X0)),
inference(cnf_transformation,[],[f84]) ).
cnf(c_77,negated_conjecture,
( ~ r3(X0,X1,X2)
| ~ r4(X3,X3,X1)
| ~ r4(X4,X4,X0)
| ~ r4(X5,X5,X2) ),
inference(cnf_transformation,[],[f107]) ).
cnf(c_192,plain,
r3(X0,sK13(X0),X0),
inference(light_normalisation,[status(thm)],[c_67,c_66]) ).
cnf(c_731,plain,
sK13(X0) = sK0,
inference(superposition,[status(thm)],[c_68,c_49]) ).
cnf(c_732,plain,
sK15(X0) = sK0,
inference(superposition,[status(thm)],[c_69,c_49]) ).
cnf(c_733,plain,
sK16(X0) = sK0,
inference(superposition,[status(thm)],[c_71,c_49]) ).
cnf(c_734,plain,
r3(X0,sK0,X0),
inference(demodulation,[status(thm)],[c_192,c_731]) ).
cnf(c_736,plain,
r4(X0,sK16(X0),sK0),
inference(demodulation,[status(thm)],[c_70,c_732]) ).
cnf(c_741,plain,
( ~ r4(X0,X0,X1)
| ~ r4(X2,X2,X1)
| ~ r4(X3,X3,sK0) ),
inference(superposition,[status(thm)],[c_734,c_77]) ).
cnf(c_752,plain,
( ~ r4(X0,X0,sK3(X1,X1))
| ~ r4(X2,X2,sK0) ),
inference(superposition,[status(thm)],[c_56,c_741]) ).
cnf(c_775,plain,
~ r4(X0,X0,sK0),
inference(superposition,[status(thm)],[c_56,c_752]) ).
cnf(c_781,plain,
r4(X0,sK0,sK0),
inference(light_normalisation,[status(thm)],[c_736,c_733]) ).
cnf(c_782,plain,
$false,
inference(superposition,[status(thm)],[c_781,c_775]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN059+2 : TPTP v8.1.2. Bugfixed v7.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.16/0.34 % Computer : n029.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Sun Aug 27 09:54:55 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.69/1.14 % SZS status Started for theBenchmark.p
% 2.69/1.14 % SZS status Theorem for theBenchmark.p
% 2.69/1.14
% 2.69/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.69/1.14
% 2.69/1.14 ------ iProver source info
% 2.69/1.14
% 2.69/1.14 git: date: 2023-05-31 18:12:56 +0000
% 2.69/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.69/1.14 git: non_committed_changes: false
% 2.69/1.14 git: last_make_outside_of_git: false
% 2.69/1.14
% 2.69/1.14 ------ Parsing...
% 2.69/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.69/1.14
% 2.69/1.14 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.69/1.14
% 2.69/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.69/1.14
% 2.69/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.69/1.14 ------ Proving...
% 2.69/1.14 ------ Problem Properties
% 2.69/1.14
% 2.69/1.14
% 2.69/1.14 clauses 29
% 2.69/1.14 conjectures 1
% 2.69/1.14 EPR 5
% 2.69/1.14 Horn 25
% 2.69/1.14 unary 18
% 2.69/1.14 binary 9
% 2.69/1.14 lits 43
% 2.69/1.14 lits eq 10
% 2.69/1.14 fd_pure 0
% 2.69/1.14 fd_pseudo 0
% 2.69/1.14 fd_cond 1
% 2.69/1.14 fd_pseudo_cond 4
% 2.69/1.14 AC symbols 0
% 2.69/1.14
% 2.69/1.14 ------ Schedule dynamic 5 is on
% 2.69/1.14
% 2.69/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.69/1.14
% 2.69/1.14
% 2.69/1.14 ------
% 2.69/1.14 Current options:
% 2.69/1.14 ------
% 2.69/1.14
% 2.69/1.14
% 2.69/1.14
% 2.69/1.14
% 2.69/1.14 ------ Proving...
% 2.69/1.14
% 2.69/1.14
% 2.69/1.14 % SZS status Theorem for theBenchmark.p
% 2.69/1.14
% 2.69/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.69/1.14
% 2.69/1.14
%------------------------------------------------------------------------------