TSTP Solution File: SYN366+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN366+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:42 EDT 2023
% Result : Theorem 1.50s 1.19s
% Output : CNFRefutation 1.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 85 ( 27 ~; 16 |; 24 &)
% ( 10 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 58 ( 3 sgn; 39 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X2,X3] :
( big_r(X2,X2)
<=> big_r(X3,X2) )
& ! [X0,X1] :
( big_r(X0,X0)
<=> big_r(X0,X1) ) )
=> ( ? [X4] : big_r(X4,X4)
=> ! [X5] : big_r(X5,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2117) ).
fof(f2,negated_conjecture,
~ ( ( ! [X2,X3] :
( big_r(X2,X2)
<=> big_r(X3,X2) )
& ! [X0,X1] :
( big_r(X0,X0)
<=> big_r(X0,X1) ) )
=> ( ? [X4] : big_r(X4,X4)
=> ! [X5] : big_r(X5,X5) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0,X1] :
( big_r(X0,X0)
<=> big_r(X1,X0) )
& ! [X2,X3] :
( big_r(X2,X2)
<=> big_r(X2,X3) ) )
=> ( ? [X4] : big_r(X4,X4)
=> ! [X5] : big_r(X5,X5) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X5] : ~ big_r(X5,X5)
& ? [X4] : big_r(X4,X4)
& ! [X0,X1] :
( big_r(X0,X0)
<=> big_r(X1,X0) )
& ! [X2,X3] :
( big_r(X2,X2)
<=> big_r(X2,X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X5] : ~ big_r(X5,X5)
& ? [X4] : big_r(X4,X4)
& ! [X0,X1] :
( big_r(X0,X0)
<=> big_r(X1,X0) )
& ! [X2,X3] :
( big_r(X2,X2)
<=> big_r(X2,X3) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X5] : ~ big_r(X5,X5)
& ? [X4] : big_r(X4,X4)
& ! [X0,X1] :
( ( big_r(X0,X0)
| ~ big_r(X1,X0) )
& ( big_r(X1,X0)
| ~ big_r(X0,X0) ) )
& ! [X2,X3] :
( ( big_r(X2,X2)
| ~ big_r(X2,X3) )
& ( big_r(X2,X3)
| ~ big_r(X2,X2) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f7,plain,
( ? [X0] : ~ big_r(X0,X0)
& ? [X1] : big_r(X1,X1)
& ! [X2,X3] :
( ( big_r(X2,X2)
| ~ big_r(X3,X2) )
& ( big_r(X3,X2)
| ~ big_r(X2,X2) ) )
& ! [X4,X5] :
( ( big_r(X4,X4)
| ~ big_r(X4,X5) )
& ( big_r(X4,X5)
| ~ big_r(X4,X4) ) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ? [X0] : ~ big_r(X0,X0)
=> ~ big_r(sK0,sK0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X1] : big_r(X1,X1)
=> big_r(sK1,sK1) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ~ big_r(sK0,sK0)
& big_r(sK1,sK1)
& ! [X2,X3] :
( ( big_r(X2,X2)
| ~ big_r(X3,X2) )
& ( big_r(X3,X2)
| ~ big_r(X2,X2) ) )
& ! [X4,X5] :
( ( big_r(X4,X4)
| ~ big_r(X4,X5) )
& ( big_r(X4,X5)
| ~ big_r(X4,X4) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
fof(f11,plain,
! [X4,X5] :
( big_r(X4,X5)
| ~ big_r(X4,X4) ),
inference(cnf_transformation,[],[f10]) ).
fof(f14,plain,
! [X2,X3] :
( big_r(X2,X2)
| ~ big_r(X3,X2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f15,plain,
big_r(sK1,sK1),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
~ big_r(sK0,sK0),
inference(cnf_transformation,[],[f10]) ).
cnf(c_49,negated_conjecture,
~ big_r(sK0,sK0),
inference(cnf_transformation,[],[f16]) ).
cnf(c_50,negated_conjecture,
big_r(sK1,sK1),
inference(cnf_transformation,[],[f15]) ).
cnf(c_51,negated_conjecture,
( ~ big_r(X0,X1)
| big_r(X1,X1) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_54,negated_conjecture,
( ~ big_r(X0,X0)
| big_r(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_79,plain,
big_r(sK1,X0),
inference(resolution,[status(thm)],[c_54,c_50]) ).
cnf(c_82,plain,
big_r(X0,X0),
inference(resolution,[status(thm)],[c_79,c_51]) ).
cnf(c_83,plain,
big_r(sK0,sK0),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_84,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_83,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN366+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.15 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 22:03:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.50/1.19 % SZS status Started for theBenchmark.p
% 1.50/1.19 % SZS status Theorem for theBenchmark.p
% 1.50/1.19
% 1.50/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.50/1.19
% 1.50/1.19 ------ iProver source info
% 1.50/1.19
% 1.50/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.50/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.50/1.19 git: non_committed_changes: false
% 1.50/1.19 git: last_make_outside_of_git: false
% 1.50/1.19
% 1.50/1.19 ------ Parsing...
% 1.50/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.50/1.19
% 1.50/1.19 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.50/1.19 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.50/1.19 ------ Proving...
% 1.50/1.19 ------ Problem Properties
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19 clauses 6
% 1.50/1.19 conjectures 5
% 1.50/1.19 EPR 6
% 1.50/1.19 Horn 6
% 1.50/1.19 unary 2
% 1.50/1.19 binary 4
% 1.50/1.19 lits 10
% 1.50/1.19 lits eq 0
% 1.50/1.19 fd_pure 0
% 1.50/1.19 fd_pseudo 0
% 1.50/1.19 fd_cond 0
% 1.50/1.19 fd_pseudo_cond 0
% 1.50/1.19 AC symbols 0
% 1.50/1.19
% 1.50/1.19 ------ Schedule EPR Horn non eq is on
% 1.50/1.19
% 1.50/1.19 ------ no equalities: superposition off
% 1.50/1.19
% 1.50/1.19 ------ Option_epr_horn Time Limit: Unbounded
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19 ------
% 1.50/1.19 Current options:
% 1.50/1.19 ------
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19 ------ Proving...
% 1.50/1.19
% 1.50/1.19
% 1.50/1.19 % SZS status Theorem for theBenchmark.p
% 1.50/1.19
% 1.50/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.50/1.19
% 1.50/1.19
%------------------------------------------------------------------------------