TSTP Solution File: SYN082+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN082+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:05:12 EDT 2023
% Result : Theorem 1.22s 1.18s
% Output : CNFRefutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 2 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 117 ( 45 ~; 42 |; 22 &)
% ( 2 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 43 ( 0 sgn; 21 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( big_f(X0,f(X0))
<=> ? [X1] :
( big_f(X0,X1)
& ! [X2] :
( big_f(X2,X1)
=> big_f(X2,f(X0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel60) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( big_f(X0,f(X0))
<=> ? [X1] :
( big_f(X0,X1)
& ! [X2] :
( big_f(X2,X1)
=> big_f(X2,f(X0)) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0] :
( big_f(X0,f(X0))
<~> ? [X1] :
( big_f(X0,X1)
& ! [X2] :
( big_f(X2,f(X0))
| ~ big_f(X2,X1) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0] :
( ( ! [X1] :
( ~ big_f(X0,X1)
| ? [X2] :
( ~ big_f(X2,f(X0))
& big_f(X2,X1) ) )
| ~ big_f(X0,f(X0)) )
& ( ? [X1] :
( big_f(X0,X1)
& ! [X2] :
( big_f(X2,f(X0))
| ~ big_f(X2,X1) ) )
| big_f(X0,f(X0)) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0] :
( ( ! [X1] :
( ~ big_f(X0,X1)
| ? [X2] :
( ~ big_f(X2,f(X0))
& big_f(X2,X1) ) )
| ~ big_f(X0,f(X0)) )
& ( ? [X3] :
( big_f(X0,X3)
& ! [X4] :
( big_f(X4,f(X0))
| ~ big_f(X4,X3) ) )
| big_f(X0,f(X0)) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ? [X0] :
( ( ! [X1] :
( ~ big_f(X0,X1)
| ? [X2] :
( ~ big_f(X2,f(X0))
& big_f(X2,X1) ) )
| ~ big_f(X0,f(X0)) )
& ( ? [X3] :
( big_f(X0,X3)
& ! [X4] :
( big_f(X4,f(X0))
| ~ big_f(X4,X3) ) )
| big_f(X0,f(X0)) ) )
=> ( ( ! [X1] :
( ~ big_f(sK0,X1)
| ? [X2] :
( ~ big_f(X2,f(sK0))
& big_f(X2,X1) ) )
| ~ big_f(sK0,f(sK0)) )
& ( ? [X3] :
( big_f(sK0,X3)
& ! [X4] :
( big_f(X4,f(sK0))
| ~ big_f(X4,X3) ) )
| big_f(sK0,f(sK0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
! [X1] :
( ? [X2] :
( ~ big_f(X2,f(sK0))
& big_f(X2,X1) )
=> ( ~ big_f(sK1(X1),f(sK0))
& big_f(sK1(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X3] :
( big_f(sK0,X3)
& ! [X4] :
( big_f(X4,f(sK0))
| ~ big_f(X4,X3) ) )
=> ( big_f(sK0,sK2)
& ! [X4] :
( big_f(X4,f(sK0))
| ~ big_f(X4,sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ( ! [X1] :
( ~ big_f(sK0,X1)
| ( ~ big_f(sK1(X1),f(sK0))
& big_f(sK1(X1),X1) ) )
| ~ big_f(sK0,f(sK0)) )
& ( ( big_f(sK0,sK2)
& ! [X4] :
( big_f(X4,f(sK0))
| ~ big_f(X4,sK2) ) )
| big_f(sK0,f(sK0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f8,f7,f6]) ).
fof(f10,plain,
! [X4] :
( big_f(X4,f(sK0))
| ~ big_f(X4,sK2)
| big_f(sK0,f(sK0)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
( big_f(sK0,sK2)
| big_f(sK0,f(sK0)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X1] :
( ~ big_f(sK0,X1)
| big_f(sK1(X1),X1)
| ~ big_f(sK0,f(sK0)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X1] :
( ~ big_f(sK0,X1)
| ~ big_f(sK1(X1),f(sK0))
| ~ big_f(sK0,f(sK0)) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
( ~ big_f(sK1(X0),f(sK0))
| ~ big_f(sK0,f(sK0))
| ~ big_f(sK0,X0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,negated_conjecture,
( ~ big_f(sK0,f(sK0))
| ~ big_f(sK0,X0)
| big_f(sK1(X0),X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_51,negated_conjecture,
( big_f(sK0,f(sK0))
| big_f(sK0,sK2) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_52,negated_conjecture,
( ~ big_f(X0,sK2)
| big_f(X0,f(sK0))
| big_f(sK0,f(sK0)) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_53,plain,
( ~ big_f(sK0,sK2)
| big_f(sK0,f(sK0)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_56,negated_conjecture,
big_f(sK0,f(sK0)),
inference(global_subsumption_just,[status(thm)],[c_51,c_51,c_53]) ).
cnf(c_60,negated_conjecture,
( ~ big_f(sK0,X0)
| big_f(sK1(X0),X0) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_50,c_56]) ).
cnf(c_63,negated_conjecture,
( ~ big_f(sK1(X0),f(sK0))
| ~ big_f(sK0,X0) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_51,c_53,c_49]) ).
cnf(c_86,plain,
( ~ big_f(sK1(f(sK0)),f(sK0))
| ~ big_f(sK0,f(sK0)) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_87,plain,
( ~ big_f(sK0,f(sK0))
| big_f(sK1(f(sK0)),f(sK0)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_88,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_87,c_86,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN082+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n031.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat Aug 26 19:11:53 EDT 2023
% 0.15/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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.22/1.18 % SZS status Started for theBenchmark.p
% 1.22/1.18 % SZS status Theorem for theBenchmark.p
% 1.22/1.18
% 1.22/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.22/1.18
% 1.22/1.18 ------ iProver source info
% 1.22/1.18
% 1.22/1.18 git: date: 2023-05-31 18:12:56 +0000
% 1.22/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.22/1.18 git: non_committed_changes: false
% 1.22/1.18 git: last_make_outside_of_git: false
% 1.22/1.18
% 1.22/1.18 ------ Parsing...
% 1.22/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.22/1.18
% 1.22/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.22/1.18
% 1.22/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.22/1.18 ------ Proving...
% 1.22/1.18 ------ Problem Properties
% 1.22/1.18
% 1.22/1.18
% 1.22/1.18 clauses 3
% 1.22/1.18 conjectures 3
% 1.22/1.18 EPR 0
% 1.22/1.18 Horn 3
% 1.22/1.18 unary 1
% 1.22/1.18 binary 2
% 1.22/1.18 lits 5
% 1.22/1.18 lits eq 0
% 1.22/1.18 fd_pure 0
% 1.22/1.18 fd_pseudo 0
% 1.22/1.18 fd_cond 0
% 1.22/1.18 fd_pseudo_cond 0
% 1.22/1.18 AC symbols 0
% 1.22/1.18
% 1.22/1.18 ------ Schedule dynamic 5 is on
% 1.22/1.18
% 1.22/1.18 ------ no equalities: superposition off
% 1.22/1.18
% 1.22/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.22/1.18
% 1.22/1.18
% 1.22/1.18 ------
% 1.22/1.18 Current options:
% 1.22/1.18 ------
% 1.22/1.18
% 1.22/1.18
% 1.22/1.18
% 1.22/1.18
% 1.22/1.18 ------ Proving...
% 1.22/1.18
% 1.22/1.18
% 1.22/1.18 % SZS status Theorem for theBenchmark.p
% 1.22/1.18
% 1.22/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.22/1.18
% 1.22/1.18
%------------------------------------------------------------------------------