TSTP Solution File: SYN413+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN413+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 03:30:32 EDT 2024
% Result : Theorem 1.59s 1.20s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 94 ( 37 ~; 30 |; 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 : 59 ( 5 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/sandbox/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_72,negated_conjecture,
( ~ f(X0,sK1(X1))
| ~ f(X0,X0) ),
inference(demodulation,[status(thm)],[c_51]) ).
cnf(c_73,negated_conjecture,
( ~ f(X0,X1)
| f(X0,sK1(X1))
| f(X0,X0) ),
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_74,negated_conjecture,
f(X0,sK0),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_77,plain,
( ~ f(sK1(X0),X1)
| f(sK1(X0),sK1(X0))
| f(sK1(X0),sK1(X1)) ),
inference(instantiation,[status(thm)],[c_73]) ).
cnf(c_78,plain,
~ f(sK1(X0),sK1(X0)),
inference(instantiation,[status(thm)],[c_72]) ).
cnf(c_79,plain,
( ~ f(sK1(sK0),sK0)
| f(sK1(sK0),sK1(sK0)) ),
inference(instantiation,[status(thm)],[c_77]) ).
cnf(c_80,plain,
~ f(sK1(sK0),sK1(sK0)),
inference(instantiation,[status(thm)],[c_78]) ).
cnf(c_87,plain,
f(sK1(X0),sK0),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_88,plain,
f(sK1(sK0),sK0),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_89,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_88,c_80,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.15 % Problem : SYN413+1 : TPTP v8.1.2. Released v2.0.0.
% 0.14/0.16 % Command : run_iprover %s %d THM
% 0.15/0.38 % Computer : n002.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Thu May 2 21:13:12 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.59/1.20 % SZS status Started for theBenchmark.p
% 1.59/1.20 % SZS status Theorem for theBenchmark.p
% 1.59/1.20
% 1.59/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.59/1.20
% 1.59/1.20 ------ iProver source info
% 1.59/1.20
% 1.59/1.20 git: date: 2024-05-02 19:28:25 +0000
% 1.59/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.59/1.20 git: non_committed_changes: false
% 1.59/1.20
% 1.59/1.20 ------ Parsing...
% 1.59/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.59/1.20
% 1.59/1.20 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.59/1.20
% 1.59/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.59/1.20 ------ Proving...
% 1.59/1.20 ------ Problem Properties
% 1.59/1.20
% 1.59/1.20
% 1.59/1.20 clauses 4
% 1.59/1.20 conjectures 4
% 1.59/1.20 EPR 1
% 1.59/1.20 Horn 3
% 1.59/1.20 unary 1
% 1.59/1.20 binary 2
% 1.59/1.20 lits 8
% 1.59/1.20 lits eq 0
% 1.59/1.20 fd_pure 0
% 1.59/1.20 fd_pseudo 0
% 1.59/1.20 fd_cond 0
% 1.59/1.20 fd_pseudo_cond 0
% 1.59/1.20 AC symbols 0
% 1.59/1.20
% 1.59/1.20 ------ Schedule dynamic 5 is on
% 1.59/1.20
% 1.59/1.20 ------ no equalities: superposition off
% 1.59/1.20
% 1.59/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.59/1.20
% 1.59/1.20
% 1.59/1.20 ------
% 1.59/1.20 Current options:
% 1.59/1.20 ------
% 1.59/1.20
% 1.59/1.20
% 1.59/1.20
% 1.59/1.20
% 1.59/1.20 ------ Proving...
% 1.59/1.20
% 1.59/1.20
% 1.59/1.20 % SZS status Theorem for theBenchmark.p
% 1.59/1.20
% 1.59/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.59/1.20
% 1.59/1.20
%------------------------------------------------------------------------------