TSTP Solution File: NUN067+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUN067+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:16 EDT 2023
% Result : Theorem 2.39s 1.17s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 58 ( 23 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 66 ( 33 ~; 17 |; 14 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 47 ( 5 sgn; 31 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X2] :
? [X3] :
! [X4] :
( ( X3 = X4
& r2(X2,X4) )
| ( X3 != X4
& ~ r2(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f11,axiom,
! [X40,X41] :
( ~ r2(X40,X41)
| ! [X42] :
( X41 != X42
| ~ r1(X42) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7a) ).
fof(f12,conjecture,
? [X38] :
! [X21] :
( X21 != X38
| ~ r1(X21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosexist) ).
fof(f13,negated_conjecture,
~ ? [X38] :
! [X21] :
( X21 != X38
| ~ r1(X21) ),
inference(negated_conjecture,[],[f12]) ).
fof(f14,plain,
! [X0] :
? [X1] :
! [X2] :
( ( X1 = X2
& r2(X0,X2) )
| ( X1 != X2
& ~ r2(X0,X2) ) ),
inference(rectify,[],[f2]) ).
fof(f23,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( X1 != X2
| ~ r1(X2) ) ),
inference(rectify,[],[f11]) ).
fof(f24,plain,
~ ? [X0] :
! [X1] :
( X0 != X1
| ~ r1(X1) ),
inference(rectify,[],[f13]) ).
fof(f25,plain,
! [X0] :
? [X1] :
( X0 = X1
& r1(X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f28,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( X1 = X2
& r2(X0,X2) )
| ( X1 != X2
& ~ r2(X0,X2) ) )
=> ! [X2] :
( ( sK1(X0) = X2
& r2(X0,X2) )
| ( sK1(X0) != X2
& ~ r2(X0,X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X2] :
( ( sK1(X0) = X2
& r2(X0,X2) )
| ( sK1(X0) != X2
& ~ r2(X0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f14,f28]) ).
fof(f54,plain,
! [X0] :
( ? [X1] :
( X0 = X1
& r1(X1) )
=> ( sK20(X0) = X0
& r1(sK20(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
! [X0] :
( sK20(X0) = X0
& r1(sK20(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20])],[f25,f54]) ).
fof(f61,plain,
! [X2,X0] :
( r2(X0,X2)
| sK1(X0) != X2 ),
inference(cnf_transformation,[],[f29]) ).
fof(f94,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| X1 != X2
| ~ r1(X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f95,plain,
! [X0] : r1(sK20(X0)),
inference(cnf_transformation,[],[f55]) ).
fof(f96,plain,
! [X0] : sK20(X0) = X0,
inference(cnf_transformation,[],[f55]) ).
fof(f103,plain,
! [X0] : r2(X0,sK1(X0)),
inference(equality_resolution,[],[f61]) ).
fof(f109,plain,
! [X2,X0] :
( ~ r2(X0,X2)
| ~ r1(X2) ),
inference(equality_resolution,[],[f94]) ).
cnf(c_52,plain,
r2(X0,sK1(X0)),
inference(cnf_transformation,[],[f103]) ).
cnf(c_76,plain,
( ~ r2(X0,X1)
| ~ r1(X1) ),
inference(cnf_transformation,[],[f109]) ).
cnf(c_77,negated_conjecture,
sK20(X0) = X0,
inference(cnf_transformation,[],[f96]) ).
cnf(c_78,negated_conjecture,
r1(sK20(X0)),
inference(cnf_transformation,[],[f95]) ).
cnf(c_190,plain,
r1(X0),
inference(demodulation,[status(thm)],[c_78,c_77]) ).
cnf(c_192,plain,
~ r2(X0,X1),
inference(forward_subsumption_resolution,[status(thm)],[c_76,c_190]) ).
cnf(c_193,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_192]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN067+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 09:31:54 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.39/1.17 % SZS status Started for theBenchmark.p
% 2.39/1.17 % SZS status Theorem for theBenchmark.p
% 2.39/1.17
% 2.39/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.39/1.17
% 2.39/1.17 ------ iProver source info
% 2.39/1.17
% 2.39/1.17 git: date: 2023-05-31 18:12:56 +0000
% 2.39/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.39/1.17 git: non_committed_changes: false
% 2.39/1.17 git: last_make_outside_of_git: false
% 2.39/1.17
% 2.39/1.17 ------ Parsing...
% 2.39/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.39/1.17
% 2.39/1.17 ------ Preprocessing...
% 2.39/1.17
% 2.39/1.17 % SZS status Theorem for theBenchmark.p
% 2.39/1.17
% 2.39/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.39/1.17
% 2.39/1.17
%------------------------------------------------------------------------------