TSTP Solution File: SYN413+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN413+1 : TPTP v8.1.2. Released v2.0.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 : Fri Sep 1 03:06:58 EDT 2023
% Result : Theorem 1.51s 1.16s
% Output : CNFRefutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 88 ( 34 ~; 27 |; 20 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 54 ( 3 sgn; 31 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
? [X1] :
! [X2] :
( f(X2,X1)
<=> ( ~ f(X2,X2)
& f(X2,X0) ) )
=> ~ ? [X3] :
! [X4] : f(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish256) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
? [X1] :
! [X2] :
( f(X2,X1)
<=> ( ~ f(X2,X2)
& f(X2,X0) ) )
=> ~ ? [X3] :
! [X4] : f(X4,X3) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
( ? [X3] :
! [X4] : f(X4,X3)
& ! [X0] :
? [X1] :
! [X2] :
( f(X2,X1)
<=> ( ~ f(X2,X2)
& f(X2,X0) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ? [X3] :
! [X4] : f(X4,X3)
& ! [X0] :
? [X1] :
! [X2] :
( ( f(X2,X1)
| f(X2,X2)
| ~ f(X2,X0) )
& ( ( ~ f(X2,X2)
& f(X2,X0) )
| ~ f(X2,X1) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X3] :
! [X4] : f(X4,X3)
& ! [X0] :
? [X1] :
! [X2] :
( ( f(X2,X1)
| f(X2,X2)
| ~ f(X2,X0) )
& ( ( ~ f(X2,X2)
& f(X2,X0) )
| ~ f(X2,X1) ) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0] :
! [X1] : f(X1,X0)
& ! [X2] :
? [X3] :
! [X4] :
( ( f(X4,X3)
| f(X4,X4)
| ~ f(X4,X2) )
& ( ( ~ f(X4,X4)
& f(X4,X2) )
| ~ f(X4,X3) ) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0] :
! [X1] : f(X1,X0)
=> ! [X1] : f(X1,sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2] :
( ? [X3] :
! [X4] :
( ( f(X4,X3)
| f(X4,X4)
| ~ f(X4,X2) )
& ( ( ~ f(X4,X4)
& f(X4,X2) )
| ~ f(X4,X3) ) )
=> ! [X4] :
( ( f(X4,sK1(X2))
| f(X4,X4)
| ~ f(X4,X2) )
& ( ( ~ f(X4,X4)
& f(X4,X2) )
| ~ f(X4,sK1(X2)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ! [X1] : f(X1,sK0)
& ! [X2,X4] :
( ( f(X4,sK1(X2))
| f(X4,X4)
| ~ f(X4,X2) )
& ( ( ~ f(X4,X4)
& f(X4,X2) )
| ~ f(X4,sK1(X2)) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f11,plain,
! [X2,X4] :
( ~ f(X4,X4)
| ~ f(X4,sK1(X2)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X2,X4] :
( f(X4,sK1(X2))
| f(X4,X4)
| ~ f(X4,X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X1] : f(X1,sK0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
f(X0,sK0),
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,negated_conjecture,
( ~ f(X0,X1)
| f(X0,sK1(X1))
| f(X0,X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_51,negated_conjecture,
( ~ f(X0,sK1(X1))
| ~ f(X0,X0) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_73,plain,
( ~ f(sK1(X0),X1)
| f(sK1(X0),sK1(X0))
| f(sK1(X0),sK1(X1)) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_74,plain,
~ f(sK1(X0),sK1(X0)),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_75,plain,
( ~ f(sK1(sK0),sK0)
| f(sK1(sK0),sK1(sK0)) ),
inference(instantiation,[status(thm)],[c_73]) ).
cnf(c_76,plain,
~ f(sK1(sK0),sK1(sK0)),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_83,plain,
f(sK1(X0),sK0),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_84,plain,
f(sK1(sK0),sK0),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_85,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_84,c_76,c_75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN413+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n029.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 : Sat Aug 26 20:04:56 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.51/1.16 % SZS status Started for theBenchmark.p
% 1.51/1.16 % SZS status Theorem for theBenchmark.p
% 1.51/1.16
% 1.51/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.51/1.16
% 1.51/1.16 ------ iProver source info
% 1.51/1.16
% 1.51/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.51/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.51/1.16 git: non_committed_changes: false
% 1.51/1.16 git: last_make_outside_of_git: false
% 1.51/1.16
% 1.51/1.16 ------ Parsing...
% 1.51/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.51/1.16
% 1.51/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.51/1.16
% 1.51/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.51/1.16 ------ Proving...
% 1.51/1.16 ------ Problem Properties
% 1.51/1.16
% 1.51/1.16
% 1.51/1.16 clauses 4
% 1.51/1.16 conjectures 4
% 1.51/1.16 EPR 1
% 1.51/1.16 Horn 3
% 1.51/1.16 unary 1
% 1.51/1.16 binary 2
% 1.51/1.16 lits 8
% 1.51/1.16 lits eq 0
% 1.51/1.16 fd_pure 0
% 1.51/1.16 fd_pseudo 0
% 1.51/1.16 fd_cond 0
% 1.51/1.16 fd_pseudo_cond 0
% 1.51/1.16 AC symbols 0
% 1.51/1.16
% 1.51/1.16 ------ Schedule dynamic 5 is on
% 1.51/1.16
% 1.51/1.16 ------ no equalities: superposition off
% 1.51/1.16
% 1.51/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.51/1.16
% 1.51/1.16
% 1.51/1.16 ------
% 1.51/1.16 Current options:
% 1.51/1.16 ------
% 1.51/1.16
% 1.51/1.16
% 1.51/1.16
% 1.51/1.16
% 1.51/1.16 ------ Proving...
% 1.51/1.16
% 1.51/1.16
% 1.51/1.16 % SZS status Theorem for theBenchmark.p
% 1.51/1.16
% 1.51/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.65/1.16
% 1.65/1.16
%------------------------------------------------------------------------------