TSTP Solution File: SYO607+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYO607+1 : TPTP v8.1.2. Released v7.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 04:40:21 EDT 2023
% Result : Theorem 1.77s 1.15s
% Output : CNFRefutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 109 ( 8 unt; 0 def)
% Number of atoms : 393 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 449 ( 165 ~; 217 |; 55 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 252 ( 33 sgn; 103 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ~ ? [X0] :
! [X1] : g_true_only(X0,X1)
& ? [X0] :
( ~ ? [X1] : g_false_only(X0,X1)
& ? [X1] : g_both(X0,X1) )
& ~ ? [X0] :
( ? [X1] : g_false_only(X0,X1)
& g_false_only(a,X0) )
& ? [X0] :
( ~ ! [X1] : g_true_only(X0,X1)
& ~ g_true_only(a,X0)
& ( ( ~ ? [X1] : g_false_only(X0,X1)
& ? [X1] : g_both(X0,X1) )
| g_both(a,X0) ) ) )
| ? [X0] :
! [X1] : g_true_only(X0,X1)
| ? [X0] :
( ? [X1] : g_false_only(X0,X1)
& g_false_only(a,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nc6) ).
fof(f2,negated_conjecture,
~ ( ( ~ ? [X0] :
! [X1] : g_true_only(X0,X1)
& ? [X0] :
( ~ ? [X1] : g_false_only(X0,X1)
& ? [X1] : g_both(X0,X1) )
& ~ ? [X0] :
( ? [X1] : g_false_only(X0,X1)
& g_false_only(a,X0) )
& ? [X0] :
( ~ ! [X1] : g_true_only(X0,X1)
& ~ g_true_only(a,X0)
& ( ( ~ ? [X1] : g_false_only(X0,X1)
& ? [X1] : g_both(X0,X1) )
| g_both(a,X0) ) ) )
| ? [X0] :
! [X1] : g_true_only(X0,X1)
| ? [X0] :
( ? [X1] : g_false_only(X0,X1)
& g_false_only(a,X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,axiom,
! [X2,X3] :
( g_true_only(X2,X3)
<=> ( ~ g_false(X2,X3)
& g_true(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',true_only_g) ).
fof(f4,axiom,
! [X2,X3] :
( g_both(X2,X3)
<=> ( g_false(X2,X3)
& g_true(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',both_g) ).
fof(f5,axiom,
! [X2,X3] :
( g_false_only(X2,X3)
<=> ( ~ g_true(X2,X3)
& g_false(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',false_only_g) ).
fof(f6,axiom,
! [X2,X3] :
( g_false_only(X2,X3)
| g_both(X2,X3)
| g_true_only(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exhaustion_g) ).
fof(f7,plain,
~ ( ( ~ ? [X0] :
! [X1] : g_true_only(X0,X1)
& ? [X2] :
( ~ ? [X3] : g_false_only(X2,X3)
& ? [X4] : g_both(X2,X4) )
& ~ ? [X5] :
( ? [X6] : g_false_only(X5,X6)
& g_false_only(a,X5) )
& ? [X7] :
( ~ ! [X8] : g_true_only(X7,X8)
& ~ g_true_only(a,X7)
& ( ( ~ ? [X9] : g_false_only(X7,X9)
& ? [X10] : g_both(X7,X10) )
| g_both(a,X7) ) ) )
| ? [X11] :
! [X12] : g_true_only(X11,X12)
| ? [X13] :
( ? [X14] : g_false_only(X13,X14)
& g_false_only(a,X13) ) ),
inference(rectify,[],[f2]) ).
fof(f8,plain,
! [X0,X1] :
( g_true_only(X0,X1)
<=> ( ~ g_false(X0,X1)
& g_true(X0,X1) ) ),
inference(rectify,[],[f3]) ).
fof(f9,plain,
! [X0,X1] :
( g_both(X0,X1)
<=> ( g_false(X0,X1)
& g_true(X0,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f10,plain,
! [X0,X1] :
( g_false_only(X0,X1)
<=> ( ~ g_true(X0,X1)
& g_false(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f11,plain,
! [X0,X1] :
( g_false_only(X0,X1)
| g_both(X0,X1)
| g_true_only(X0,X1) ),
inference(rectify,[],[f6]) ).
fof(f12,plain,
( ( ? [X0] :
! [X1] : g_true_only(X0,X1)
| ! [X2] :
( ? [X3] : g_false_only(X2,X3)
| ! [X4] : ~ g_both(X2,X4) )
| ? [X5] :
( ? [X6] : g_false_only(X5,X6)
& g_false_only(a,X5) )
| ! [X7] :
( ! [X8] : g_true_only(X7,X8)
| g_true_only(a,X7)
| ( ( ? [X9] : g_false_only(X7,X9)
| ! [X10] : ~ g_both(X7,X10) )
& ~ g_both(a,X7) ) ) )
& ! [X11] :
? [X12] : ~ g_true_only(X11,X12)
& ! [X13] :
( ! [X14] : ~ g_false_only(X13,X14)
| ~ g_false_only(a,X13) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
( ? [X0] :
! [X1] : g_true_only(X0,X1)
=> ! [X1] : g_true_only(sK0,X1) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X2] :
( ? [X3] : g_false_only(X2,X3)
=> g_false_only(X2,sK1(X2)) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X5] :
( ? [X6] : g_false_only(X5,X6)
& g_false_only(a,X5) )
=> ( ? [X6] : g_false_only(sK2,X6)
& g_false_only(a,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X6] : g_false_only(sK2,X6)
=> g_false_only(sK2,sK3) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X7] :
( ? [X9] : g_false_only(X7,X9)
=> g_false_only(X7,sK4(X7)) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X11] :
( ? [X12] : ~ g_true_only(X11,X12)
=> ~ g_true_only(X11,sK5(X11)) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
( ( ! [X1] : g_true_only(sK0,X1)
| ! [X2] :
( g_false_only(X2,sK1(X2))
| ! [X4] : ~ g_both(X2,X4) )
| ( g_false_only(sK2,sK3)
& g_false_only(a,sK2) )
| ! [X7] :
( ! [X8] : g_true_only(X7,X8)
| g_true_only(a,X7)
| ( ( g_false_only(X7,sK4(X7))
| ! [X10] : ~ g_both(X7,X10) )
& ~ g_both(a,X7) ) ) )
& ! [X11] : ~ g_true_only(X11,sK5(X11))
& ! [X13] :
( ! [X14] : ~ g_false_only(X13,X14)
| ~ g_false_only(a,X13) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f12,f18,f17,f16,f15,f14,f13]) ).
fof(f20,plain,
! [X0,X1] :
( ( g_true_only(X0,X1)
| g_false(X0,X1)
| ~ g_true(X0,X1) )
& ( ( ~ g_false(X0,X1)
& g_true(X0,X1) )
| ~ g_true_only(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f21,plain,
! [X0,X1] :
( ( g_true_only(X0,X1)
| g_false(X0,X1)
| ~ g_true(X0,X1) )
& ( ( ~ g_false(X0,X1)
& g_true(X0,X1) )
| ~ g_true_only(X0,X1) ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ( g_both(X0,X1)
| ~ g_false(X0,X1)
| ~ g_true(X0,X1) )
& ( ( g_false(X0,X1)
& g_true(X0,X1) )
| ~ g_both(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f23,plain,
! [X0,X1] :
( ( g_both(X0,X1)
| ~ g_false(X0,X1)
| ~ g_true(X0,X1) )
& ( ( g_false(X0,X1)
& g_true(X0,X1) )
| ~ g_both(X0,X1) ) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ( g_false_only(X0,X1)
| g_true(X0,X1)
| ~ g_false(X0,X1) )
& ( ( ~ g_true(X0,X1)
& g_false(X0,X1) )
| ~ g_false_only(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f25,plain,
! [X0,X1] :
( ( g_false_only(X0,X1)
| g_true(X0,X1)
| ~ g_false(X0,X1) )
& ( ( ~ g_true(X0,X1)
& g_false(X0,X1) )
| ~ g_false_only(X0,X1) ) ),
inference(flattening,[],[f24]) ).
fof(f26,plain,
! [X14,X13] :
( ~ g_false_only(X13,X14)
| ~ g_false_only(a,X13) ),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
! [X11] : ~ g_true_only(X11,sK5(X11)),
inference(cnf_transformation,[],[f19]) ).
fof(f28,plain,
! [X2,X1,X8,X7,X4] :
( g_true_only(sK0,X1)
| g_false_only(X2,sK1(X2))
| ~ g_both(X2,X4)
| g_false_only(a,sK2)
| g_true_only(X7,X8)
| g_true_only(a,X7)
| ~ g_both(a,X7) ),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
! [X2,X10,X1,X8,X7,X4] :
( g_true_only(sK0,X1)
| g_false_only(X2,sK1(X2))
| ~ g_both(X2,X4)
| g_false_only(a,sK2)
| g_true_only(X7,X8)
| g_true_only(a,X7)
| g_false_only(X7,sK4(X7))
| ~ g_both(X7,X10) ),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
! [X2,X1,X8,X7,X4] :
( g_true_only(sK0,X1)
| g_false_only(X2,sK1(X2))
| ~ g_both(X2,X4)
| g_false_only(sK2,sK3)
| g_true_only(X7,X8)
| g_true_only(a,X7)
| ~ g_both(a,X7) ),
inference(cnf_transformation,[],[f19]) ).
fof(f31,plain,
! [X2,X10,X1,X8,X7,X4] :
( g_true_only(sK0,X1)
| g_false_only(X2,sK1(X2))
| ~ g_both(X2,X4)
| g_false_only(sK2,sK3)
| g_true_only(X7,X8)
| g_true_only(a,X7)
| g_false_only(X7,sK4(X7))
| ~ g_both(X7,X10) ),
inference(cnf_transformation,[],[f19]) ).
fof(f32,plain,
! [X0,X1] :
( g_true(X0,X1)
| ~ g_true_only(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f33,plain,
! [X0,X1] :
( ~ g_false(X0,X1)
| ~ g_true_only(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f34,plain,
! [X0,X1] :
( g_true_only(X0,X1)
| g_false(X0,X1)
| ~ g_true(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f35,plain,
! [X0,X1] :
( g_true(X0,X1)
| ~ g_both(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f36,plain,
! [X0,X1] :
( g_false(X0,X1)
| ~ g_both(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f38,plain,
! [X0,X1] :
( g_false(X0,X1)
| ~ g_false_only(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f39,plain,
! [X0,X1] :
( ~ g_true(X0,X1)
| ~ g_false_only(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
! [X0,X1] :
( g_false_only(X0,X1)
| g_true(X0,X1)
| ~ g_false(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f41,plain,
! [X0,X1] :
( g_false_only(X0,X1)
| g_both(X0,X1)
| g_true_only(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_49,negated_conjecture,
( ~ g_both(X0,X1)
| ~ g_both(X2,X3)
| g_false_only(X0,sK1(X0))
| g_false_only(X2,sK4(X2))
| g_true_only(X2,X4)
| g_true_only(sK0,X5)
| g_true_only(a,X2)
| g_false_only(sK2,sK3) ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_50,negated_conjecture,
( ~ g_both(X0,X1)
| ~ g_both(a,X2)
| g_false_only(X0,sK1(X0))
| g_true_only(X2,X3)
| g_true_only(sK0,X4)
| g_true_only(a,X2)
| g_false_only(sK2,sK3) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_51,negated_conjecture,
( ~ g_both(X0,X1)
| ~ g_both(X2,X3)
| g_false_only(X0,sK1(X0))
| g_false_only(X2,sK4(X2))
| g_true_only(X2,X4)
| g_true_only(sK0,X5)
| g_true_only(a,X2)
| g_false_only(a,sK2) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_52,negated_conjecture,
( ~ g_both(X0,X1)
| ~ g_both(a,X2)
| g_false_only(X0,sK1(X0))
| g_true_only(X2,X3)
| g_true_only(sK0,X4)
| g_true_only(a,X2)
| g_false_only(a,sK2) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_53,negated_conjecture,
~ g_true_only(X0,sK5(X0)),
inference(cnf_transformation,[],[f27]) ).
cnf(c_54,negated_conjecture,
( ~ g_false_only(X0,X1)
| ~ g_false_only(a,X0) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_55,plain,
( ~ g_true(X0,X1)
| g_true_only(X0,X1)
| g_false(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_56,plain,
( ~ g_true_only(X0,X1)
| ~ g_false(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_57,plain,
( ~ g_true_only(X0,X1)
| g_true(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_59,plain,
( ~ g_both(X0,X1)
| g_false(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_60,plain,
( ~ g_both(X0,X1)
| g_true(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_61,plain,
( ~ g_false(X0,X1)
| g_false_only(X0,X1)
| g_true(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_62,plain,
( ~ g_false_only(X0,X1)
| ~ g_true(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_63,plain,
( ~ g_false_only(X0,X1)
| g_false(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_64,plain,
( g_true_only(X0,X1)
| g_false_only(X0,X1)
| g_both(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_65,plain,
~ g_true_only(a,sK5(a)),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_78,plain,
( g_false_only(X0,X1)
| g_true(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_61,c_60,c_57,c_64]) ).
cnf(c_81,plain,
( g_true_only(X0,X1)
| g_false(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_55,c_63,c_60,c_57,c_64,c_55]) ).
cnf(c_84,plain,
( ~ g_true(X0,X1)
| ~ g_false_only(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_62]) ).
cnf(c_85,plain,
( ~ g_false_only(X0,X1)
| ~ g_true(X0,X1) ),
inference(renaming,[status(thm)],[c_84]) ).
cnf(c_88,plain,
( ~ g_false(X0,X1)
| ~ g_true_only(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_56]) ).
cnf(c_89,plain,
( ~ g_true_only(X0,X1)
| ~ g_false(X0,X1) ),
inference(renaming,[status(thm)],[c_88]) ).
cnf(c_90,plain,
( g_false(X0,X1)
| g_true_only(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_81]) ).
cnf(c_91,plain,
( g_true_only(X0,X1)
| g_false(X0,X1) ),
inference(renaming,[status(thm)],[c_90]) ).
cnf(c_94,plain,
( ~ g_both(X0,X1)
| g_false(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
cnf(c_96,plain,
( ~ g_false_only(a,X0)
| g_true(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_54,c_78]) ).
cnf(c_135,plain,
( ~ g_false(X0,X1)
| ~ g_true(X0,X1)
| g_both(X0,X1) ),
inference(bin_hyper_res,[status(thm)],[c_64,c_85,c_89]) ).
cnf(c_245,plain,
( ~ g_true(X0,X1)
| g_true_only(X0,X1)
| g_both(X0,X1) ),
inference(resolution,[status(thm)],[c_91,c_135]) ).
cnf(c_258,plain,
( ~ g_true_only(X0,X1)
| ~ g_both(X0,X1) ),
inference(resolution,[status(thm)],[c_94,c_89]) ).
cnf(c_272,plain,
( ~ g_both(X0,X1)
| ~ g_both(a,X2)
| g_false_only(X0,sK1(X0))
| g_true_only(X2,X3)
| g_true_only(sK0,X4)
| g_false_only(sK2,sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_258]) ).
cnf(c_273,plain,
( ~ g_both(X0,X1)
| ~ g_both(a,X2)
| g_false_only(X0,sK1(X0))
| g_true_only(X2,X3)
| g_true_only(sK0,X4)
| g_false_only(a,sK2) ),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_258]) ).
cnf(c_275,plain,
( ~ g_false_only(a,X0)
| g_true_only(X0,X1)
| g_both(X0,X1) ),
inference(resolution,[status(thm)],[c_96,c_245]) ).
cnf(c_417,plain,
( g_true_only(sK0,X0)
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_273]) ).
cnf(c_418,plain,
( ~ g_both(a,X0)
| g_true_only(X0,X1)
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_273]) ).
cnf(c_419,plain,
( ~ g_both(X0,X1)
| g_false_only(X0,sK1(X0))
| ~ sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_273]) ).
cnf(c_420,plain,
( g_false_only(a,sK2)
| sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_273]) ).
cnf(c_421,plain,
( g_false_only(sK2,sK3)
| sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_272]) ).
cnf(c_422,negated_conjecture,
( ~ g_both(X0,X1)
| g_false_only(X0,sK4(X0))
| g_true_only(X0,X2)
| g_true_only(a,X0)
| ~ sP3_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP3_iProver_split])],[c_51]) ).
cnf(c_423,negated_conjecture,
( g_false_only(a,sK2)
| sP0_iProver_split
| sP2_iProver_split
| sP3_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_51]) ).
cnf(c_424,negated_conjecture,
( g_false_only(sK2,sK3)
| sP0_iProver_split
| sP2_iProver_split
| sP3_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_49]) ).
cnf(c_429,plain,
( ~ g_false_only(a,X0)
| g_true_only(X0,sK5(X0))
| g_both(X0,sK5(X0)) ),
inference(instantiation,[status(thm)],[c_275]) ).
cnf(c_430,plain,
( g_true_only(X0,sK5(X0))
| g_false_only(X0,sK5(X0))
| g_both(X0,sK5(X0)) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_431,plain,
( g_true_only(a,sK5(a))
| g_false_only(a,sK5(a))
| g_both(a,sK5(a)) ),
inference(instantiation,[status(thm)],[c_430]) ).
cnf(c_433,plain,
( ~ g_both(X0,sK5(X0))
| ~ sP2_iProver_split
| g_false_only(X0,sK1(X0)) ),
inference(instantiation,[status(thm)],[c_419]) ).
cnf(c_434,plain,
( ~ g_both(a,sK5(a))
| ~ sP2_iProver_split
| g_false_only(a,sK1(a)) ),
inference(instantiation,[status(thm)],[c_433]) ).
cnf(c_439,plain,
( ~ g_false_only(sK5(a),X0)
| ~ g_false_only(a,sK5(a)) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_448,plain,
( ~ g_false_only(a,sK5(a))
| g_true_only(sK5(a),sK5(sK5(a)))
| g_both(sK5(a),sK5(sK5(a))) ),
inference(instantiation,[status(thm)],[c_429]) ).
cnf(c_450,plain,
~ g_true_only(sK5(a),sK5(sK5(a))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_457,plain,
( ~ g_both(sK5(a),sK5(sK5(a)))
| ~ sP2_iProver_split
| g_false_only(sK5(a),sK1(sK5(a))) ),
inference(instantiation,[status(thm)],[c_433]) ).
cnf(c_465,plain,
( ~ g_false_only(sK5(a),sK1(sK5(a)))
| ~ g_false_only(a,sK5(a)) ),
inference(instantiation,[status(thm)],[c_439]) ).
cnf(c_466,plain,
( ~ g_both(sK5(a),X0)
| ~ sP3_iProver_split
| g_false_only(sK5(a),sK4(sK5(a)))
| g_true_only(sK5(a),X1)
| g_true_only(a,sK5(a)) ),
inference(instantiation,[status(thm)],[c_422]) ).
cnf(c_469,plain,
( ~ g_both(a,X0)
| ~ sP1_iProver_split
| g_true_only(X0,sK5(X0)) ),
inference(instantiation,[status(thm)],[c_418]) ).
cnf(c_479,plain,
( ~ g_both(sK5(a),sK5(sK5(a)))
| ~ sP3_iProver_split
| g_false_only(sK5(a),sK4(sK5(a)))
| g_true_only(sK5(a),X0)
| g_true_only(a,sK5(a)) ),
inference(instantiation,[status(thm)],[c_466]) ).
cnf(c_490,plain,
( ~ g_false_only(sK5(a),sK4(sK5(a)))
| ~ g_false_only(a,sK5(a)) ),
inference(instantiation,[status(thm)],[c_439]) ).
cnf(c_499,plain,
( ~ g_both(sK5(a),sK5(sK5(a)))
| ~ sP3_iProver_split
| g_true_only(sK5(a),sK5(sK5(a)))
| g_false_only(sK5(a),sK4(sK5(a)))
| g_true_only(a,sK5(a)) ),
inference(instantiation,[status(thm)],[c_479]) ).
cnf(c_513,plain,
( ~ g_false_only(sK2,X0)
| ~ g_false_only(a,sK2) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_533,plain,
( ~ g_false_only(sK2,sK3)
| ~ g_false_only(a,sK2) ),
inference(instantiation,[status(thm)],[c_513]) ).
cnf(c_548,plain,
( ~ sP0_iProver_split
| g_true_only(sK0,sK5(sK0)) ),
inference(instantiation,[status(thm)],[c_417]) ).
cnf(c_549,plain,
~ g_true_only(sK0,sK5(sK0)),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_550,negated_conjecture,
( sP2_iProver_split
| sP3_iProver_split ),
inference(global_subsumption_just,[status(thm)],[c_423,c_423,c_424,c_533,c_548,c_549]) ).
cnf(c_579,plain,
( ~ g_both(a,sK5(a))
| ~ sP1_iProver_split
| g_true_only(sK5(a),sK5(sK5(a))) ),
inference(instantiation,[status(thm)],[c_469]) ).
cnf(c_638,plain,
( ~ g_false_only(a,sK1(a))
| g_true_only(sK1(a),sK5(sK1(a)))
| g_both(sK1(a),sK5(sK1(a))) ),
inference(instantiation,[status(thm)],[c_429]) ).
cnf(c_639,plain,
( ~ g_false_only(sK1(a),X0)
| ~ g_false_only(a,sK1(a)) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_644,plain,
( sP1_iProver_split
| sP2_iProver_split ),
inference(global_subsumption_just,[status(thm)],[c_420,c_420,c_421,c_533,c_548,c_549]) ).
cnf(c_646,plain,
sP2_iProver_split,
inference(global_subsumption_just,[status(thm)],[c_644,c_65,c_431,c_448,c_450,c_490,c_499,c_550,c_579,c_644]) ).
cnf(c_820,plain,
( ~ g_false_only(sK1(a),sK1(sK1(a)))
| ~ g_false_only(a,sK1(a)) ),
inference(instantiation,[status(thm)],[c_639]) ).
cnf(c_821,plain,
( ~ g_both(sK1(a),sK5(sK1(a)))
| ~ sP2_iProver_split
| g_false_only(sK1(a),sK1(sK1(a))) ),
inference(instantiation,[status(thm)],[c_433]) ).
cnf(c_822,plain,
~ g_true_only(sK1(a),sK5(sK1(a))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_823,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_822,c_821,c_820,c_646,c_638,c_465,c_457,c_450,c_448,c_434,c_431,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO607+1 : TPTP v8.1.2. Released v7.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.16/0.34 % Computer : n028.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Sat Aug 26 01:56:37 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.77/1.15 % SZS status Started for theBenchmark.p
% 1.77/1.15 % SZS status Theorem for theBenchmark.p
% 1.77/1.15
% 1.77/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.77/1.15
% 1.77/1.15 ------ iProver source info
% 1.77/1.15
% 1.77/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.77/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.77/1.15 git: non_committed_changes: false
% 1.77/1.15 git: last_make_outside_of_git: false
% 1.77/1.15
% 1.77/1.15 ------ Parsing...
% 1.77/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.77/1.15
% 1.77/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.77/1.15
% 1.77/1.15 ------ Preprocessing... gs_s sp: 12 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.77/1.15 ------ Proving...
% 1.77/1.15 ------ Problem Properties
% 1.77/1.15
% 1.77/1.15
% 1.77/1.15 clauses 15
% 1.77/1.15 conjectures 5
% 1.77/1.15 EPR 12
% 1.77/1.15 Horn 8
% 1.77/1.15 unary 1
% 1.77/1.15 binary 5
% 1.77/1.15 lits 44
% 1.77/1.15 lits eq 0
% 1.77/1.15 fd_pure 0
% 1.77/1.15 fd_pseudo 0
% 1.77/1.15 fd_cond 0
% 1.77/1.15 fd_pseudo_cond 0
% 1.77/1.15 AC symbols 0
% 1.77/1.15
% 1.77/1.15 ------ Schedule dynamic 5 is on
% 1.77/1.15
% 1.77/1.15 ------ no equalities: superposition off
% 1.77/1.15
% 1.77/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.77/1.15
% 1.77/1.15
% 1.77/1.15 ------
% 1.77/1.15 Current options:
% 1.77/1.15 ------
% 1.77/1.15
% 1.77/1.15
% 1.77/1.15
% 1.77/1.15
% 1.77/1.15 ------ Proving...
% 1.77/1.15
% 1.77/1.15
% 1.77/1.15 % SZS status Theorem for theBenchmark.p
% 1.77/1.15
% 1.77/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.77/1.15
% 1.77/1.16
%------------------------------------------------------------------------------