TSTP Solution File: NUN069+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUN069+2 : 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 : Thu Aug 31 12:49:17 EDT 2023
% Result : Theorem 2.57s 1.13s
% Output : CNFRefutation 2.57s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f107)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( X0 = X1
& r1(X1) )
| ( X0 != X1
& ~ r1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
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(f14,plain,
! [X0] :
? [X1] :
! [X2] :
( ( X1 = X2
& r2(X0,X2) )
| ( X1 != X2
& ~ r2(X0,X2) ) ),
inference(rectify,[],[f2]) ).
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(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(f55,plain,
! [X1] :
( r1(X1)
| sK0 != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f59,plain,
! [X2,X0] :
( r2(X0,X2)
| sK1(X0) != X2 ),
inference(cnf_transformation,[],[f29]) ).
fof(f98,plain,
r1(sK0),
inference(equality_resolution,[],[f55]) ).
fof(f100,plain,
! [X0] : r2(X0,sK1(X0)),
inference(equality_resolution,[],[f59]) ).
cnf(c_50,plain,
r1(sK0),
inference(cnf_transformation,[],[f98]) ).
cnf(c_52,plain,
r2(X0,sK1(X0)),
inference(cnf_transformation,[],[f100]) ).
cnf(c_77,negated_conjecture,
( ~ r2(X0,X1)
| ~ r1(X0) ),
inference(cnf_transformation,[],[f107]) ).
cnf(c_899,plain,
~ r1(X0),
inference(superposition,[status(thm)],[c_52,c_77]) ).
cnf(c_900,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_899]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUN069+2 : TPTP v8.1.2. Released v7.3.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n006.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 09:13:07 EDT 2023
% 0.13/0.34 % 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.57/1.13 % SZS status Started for theBenchmark.p
% 2.57/1.13 % SZS status Theorem for theBenchmark.p
% 2.57/1.13
% 2.57/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.57/1.13
% 2.57/1.13 ------ iProver source info
% 2.57/1.13
% 2.57/1.13 git: date: 2023-05-31 18:12:56 +0000
% 2.57/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.57/1.13 git: non_committed_changes: false
% 2.57/1.13 git: last_make_outside_of_git: false
% 2.57/1.13
% 2.57/1.13 ------ Parsing...
% 2.57/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.57/1.13
% 2.57/1.13 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 2 sf_s rm: 3 0s sf_e pe_s pe_e
% 2.57/1.13
% 2.57/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.57/1.13
% 2.57/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.57/1.13 ------ Proving...
% 2.57/1.13 ------ Problem Properties
% 2.57/1.13
% 2.57/1.13
% 2.57/1.13 clauses 25
% 2.57/1.13 conjectures 1
% 2.57/1.13 EPR 5
% 2.57/1.13 Horn 21
% 2.57/1.13 unary 16
% 2.57/1.13 binary 8
% 2.57/1.13 lits 35
% 2.57/1.13 lits eq 15
% 2.57/1.13 fd_pure 0
% 2.57/1.13 fd_pseudo 0
% 2.57/1.13 fd_cond 1
% 2.57/1.13 fd_pseudo_cond 2
% 2.57/1.13 AC symbols 0
% 2.57/1.13
% 2.57/1.13 ------ Schedule dynamic 5 is on
% 2.57/1.13
% 2.57/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.57/1.13
% 2.57/1.13
% 2.57/1.13 ------
% 2.57/1.13 Current options:
% 2.57/1.13 ------
% 2.57/1.13
% 2.57/1.13
% 2.57/1.13
% 2.57/1.13
% 2.57/1.13 ------ Proving...
% 2.57/1.13
% 2.57/1.13
% 2.57/1.13 % SZS status Theorem for theBenchmark.p
% 2.57/1.13
% 2.57/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.57/1.13
% 2.57/1.13
%------------------------------------------------------------------------------