TSTP Solution File: NUN089+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUN089+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:21 EDT 2024
% Result : Theorem 0.49s 1.17s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 72 ( 14 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 82 ( 33 ~; 21 |; 24 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 44 ( 3 sgn 23 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
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] :
( ! [X15] :
( ~ r1(X15)
| X15 != X38 )
| ! [X21] :
( ~ r2(X21,X38)
| ! [X22] :
( ~ r2(X22,X21)
| ~ r1(X22) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerouneqtwo) ).
fof(f13,negated_conjecture,
~ ! [X38] :
( ! [X15] :
( ~ r1(X15)
| X15 != X38 )
| ! [X21] :
( ~ r2(X21,X38)
| ! [X22] :
( ~ r2(X22,X21)
| ~ r1(X22) ) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f23,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( X1 != X2
| ~ r1(X2) ) ),
inference(rectify,[],[f11]) ).
fof(f24,plain,
~ ! [X0] :
( ! [X1] :
( ~ r1(X1)
| X0 != X1 )
| ! [X2] :
( ~ r2(X2,X0)
| ! [X3] :
( ~ r2(X3,X2)
| ~ r1(X3) ) ) ),
inference(rectify,[],[f13]) ).
fof(f25,plain,
? [X0] :
( ? [X1] :
( r1(X1)
& X0 = X1 )
& ? [X2] :
( r2(X2,X0)
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f54,plain,
( ? [X0] :
( ? [X1] :
( r1(X1)
& X0 = X1 )
& ? [X2] :
( r2(X2,X0)
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) ) )
=> ( ? [X1] :
( r1(X1)
& sK20 = X1 )
& ? [X2] :
( r2(X2,sK20)
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
( ? [X1] :
( r1(X1)
& sK20 = X1 )
=> ( r1(sK21)
& sK20 = sK21 ) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
( ? [X2] :
( r2(X2,sK20)
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) )
=> ( r2(sK22,sK20)
& ? [X3] :
( r2(X3,sK22)
& r1(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
( ? [X3] :
( r2(X3,sK22)
& r1(X3) )
=> ( r2(sK23,sK22)
& r1(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f58,plain,
( r1(sK21)
& sK20 = sK21
& r2(sK22,sK20)
& r2(sK23,sK22)
& r1(sK23) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23])],[f25,f57,f56,f55,f54]) ).
fof(f97,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| X1 != X2
| ~ r1(X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f100,plain,
r2(sK22,sK20),
inference(cnf_transformation,[],[f58]) ).
fof(f101,plain,
sK20 = sK21,
inference(cnf_transformation,[],[f58]) ).
fof(f102,plain,
r1(sK21),
inference(cnf_transformation,[],[f58]) ).
fof(f106,plain,
r2(sK22,sK21),
inference(definition_unfolding,[],[f100,f101]) ).
fof(f116,plain,
! [X2,X0] :
( ~ r2(X0,X2)
| ~ r1(X2) ),
inference(equality_resolution,[],[f97]) ).
cnf(c_76,plain,
( ~ r2(X0,X1)
| ~ r1(X1) ),
inference(cnf_transformation,[],[f116]) ).
cnf(c_77,negated_conjecture,
r1(sK21),
inference(cnf_transformation,[],[f102]) ).
cnf(c_78,negated_conjecture,
r2(sK22,sK21),
inference(cnf_transformation,[],[f106]) ).
cnf(c_384,plain,
( X0 != sK21
| ~ r2(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_76,c_77]) ).
cnf(c_385,plain,
~ r2(X0,sK21),
inference(unflattening,[status(thm)],[c_384]) ).
cnf(c_414,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_78,c_385]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUN089+2 : TPTP v8.1.2. Released v7.3.0.
% 0.11/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n022.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 : Thu May 2 21:38:27 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/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
% 0.49/1.17 % SZS status Started for theBenchmark.p
% 0.49/1.17 % SZS status Theorem for theBenchmark.p
% 0.49/1.17
% 0.49/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.49/1.17
% 0.49/1.17 ------ iProver source info
% 0.49/1.17
% 0.49/1.17 git: date: 2024-05-02 19:28:25 +0000
% 0.49/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.49/1.17 git: non_committed_changes: false
% 0.49/1.17
% 0.49/1.17 ------ Parsing...
% 0.49/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.49/1.17
% 0.49/1.17 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s
% 0.49/1.17
% 0.49/1.17 % SZS status Theorem for theBenchmark.p
% 0.49/1.17
% 0.49/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.17
% 0.49/1.17
%------------------------------------------------------------------------------