TSTP Solution File: SWW679_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWW679_1 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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 : Mon Jun 24 18:17:59 EDT 2024
% Result : Theorem 2.63s 1.09s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
tff(f7,axiom,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $greater(X4,'val:(Tree)>Int'(X5)) )
& ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> $lesseq(X4,'val:(Tree)>Int'(X5)) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5)) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_006) ).
tff(f8,conjecture,
! [X5: 'Tree',X4: $int] :
( searchtree(X5)
=> ( ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( searchtree(X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( searchtree(X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_007) ).
tff(f9,negated_conjecture,
~ ! [X5: 'Tree',X4: $int] :
( searchtree(X5)
=> ( ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( searchtree(X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( searchtree(X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
inference(negated_conjecture,[],[f8]) ).
tff(f10,plain,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $less('val:(Tree)>Int'(X5),X4) )
& ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> ~ $less('val:(Tree)>Int'(X5),X4) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5)) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f30,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ( 'empty:Tree' != X0 )
=> ( ! [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X1) )
& ! [X2: $int] :
( in(X2,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X2) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) ) )
& ( ( 'empty:Tree' = X0 )
=> $true ) ) ),
inference(rectify,[],[f10]) ).
tff(f31,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( 'empty:Tree' != X0 )
=> ( ! [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X1) )
& ! [X2: $int] :
( in(X2,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X2) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) ) ) ),
inference(true_and_false_elimination,[],[f30]) ).
tff(f32,plain,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( ( 'empty:Tree' != X0 )
=> ( ( ( 'val:(Tree)>Int'(X0) != X1 )
=> ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( searchtree(X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( searchtree(X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X0) = X1 )
=> $true ) ) )
& ( ( 'empty:Tree' = X0 )
=> $true ) ) ),
inference(rectify,[],[f9]) ).
tff(f33,plain,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( 'empty:Tree' != X0 )
=> ( ( 'val:(Tree)>Int'(X0) != X1 )
=> ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( searchtree(X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( searchtree(X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) ) ) ),
inference(true_and_false_elimination,[],[f32]) ).
tff(f36,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 ) ) ),
inference(ennf_transformation,[],[f31]) ).
tff(f37,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 )
& searchtree(X0) ),
inference(ennf_transformation,[],[f33]) ).
tff(f38,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 )
& searchtree(X0) ),
inference(flattening,[],[f37]) ).
tff(f39,plain,
! [X0: 'Tree'] :
( sP0(X0)
<=> ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f40,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> sP0(X0) ),
inference(definition_folding,[],[f36,f39]) ).
tff(f43,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f39]) ).
tff(f44,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ) ),
inference(flattening,[],[f43]) ).
tff(f45,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X3: $int] :
( $less('val:(Tree)>Int'(X0),X3)
| ~ in(X3,'right:(Tree)>Tree'(X0)) )
& ! [X4: $int] :
( ~ $less('val:(Tree)>Int'(X0),X4)
| ~ in(X4,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ) ),
inference(rectify,[],[f44]) ).
tff(f46,plain,
! [X0: 'Tree'] :
( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
=> ( ~ $less('val:(Tree)>Int'(X0),sK1(X0))
& in(sK1(X0),'right:(Tree)>Tree'(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f47,plain,
! [X0: 'Tree'] :
( ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
=> ( $less('val:(Tree)>Int'(X0),sK2(X0))
& in(sK2(X0),'left:(Tree)>Tree'(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f48,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( ( ~ $less('val:(Tree)>Int'(X0),sK1(X0))
& in(sK1(X0),'right:(Tree)>Tree'(X0)) )
| ( $less('val:(Tree)>Int'(X0),sK2(X0))
& in(sK2(X0),'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X3: $int] :
( $less('val:(Tree)>Int'(X0),X3)
| ~ in(X3,'right:(Tree)>Tree'(X0)) )
& ! [X4: $int] :
( ~ $less('val:(Tree)>Int'(X0),X4)
| ~ in(X4,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f45,f47,f46]) ).
tff(f49,plain,
! [X0: 'Tree'] :
( ( searchtree(X0)
| ~ sP0(X0) )
& ( sP0(X0)
| ~ searchtree(X0) ) ),
inference(nnf_transformation,[],[f40]) ).
tff(f50,plain,
( ? [X0: 'Tree',X1: $int] :
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 )
& searchtree(X0) )
=> ( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK3) != X2 ) )
& ~ $less(sK4,'val:(Tree)>Int'(sK3)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(sK3) != X3 ) )
& $less(sK4,'val:(Tree)>Int'(sK3)) ) )
& ( sK4 != 'val:(Tree)>Int'(sK3) )
& ( 'empty:Tree' != sK3 )
& searchtree(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f51,plain,
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK3) != X2 ) )
& ~ $less(sK4,'val:(Tree)>Int'(sK3)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(sK3) != X3 ) )
& $less(sK4,'val:(Tree)>Int'(sK3)) ) )
& ( sK4 != 'val:(Tree)>Int'(sK3) )
& ( 'empty:Tree' != sK3 )
& searchtree(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f38,f50]) ).
tff(f63,plain,
! [X0: 'Tree'] :
( searchtree('left:(Tree)>Tree'(X0))
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f48]) ).
tff(f64,plain,
! [X0: 'Tree'] :
( searchtree('right:(Tree)>Tree'(X0))
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f48]) ).
tff(f72,plain,
! [X0: 'Tree'] :
( sP0(X0)
| ~ searchtree(X0) ),
inference(cnf_transformation,[],[f49]) ).
tff(f74,plain,
searchtree(sK3),
inference(cnf_transformation,[],[f51]) ).
tff(f75,plain,
'empty:Tree' != sK3,
inference(cnf_transformation,[],[f51]) ).
tff(f80,plain,
! [X2: 'Tree',X3: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK3) != X2 )
| ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(sK3) != X3 ) ),
inference(cnf_transformation,[],[f51]) ).
tff(f85,plain,
! [X3: 'Tree'] :
( ~ searchtree('right:(Tree)>Tree'(sK3))
| ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(sK3) != X3 ) ),
inference(equality_resolution,[],[f80]) ).
tff(f86,plain,
( ~ searchtree('right:(Tree)>Tree'(sK3))
| ~ searchtree('left:(Tree)>Tree'(sK3)) ),
inference(equality_resolution,[],[f85]) ).
cnf(c_78,plain,
( ~ sP0(X0_13)
| X0_13 = 'empty:Tree'
| searchtree('right:(Tree)>Tree'(X0_13)) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_79,plain,
( ~ sP0(X0_13)
| X0_13 = 'empty:Tree'
| searchtree('left:(Tree)>Tree'(X0_13)) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_81,plain,
( ~ searchtree(X0_13)
| sP0(X0_13) ),
inference(cnf_transformation,[],[f72]) ).
cnf(c_82,negated_conjecture,
( ~ searchtree('left:(Tree)>Tree'(sK3))
| ~ searchtree('right:(Tree)>Tree'(sK3)) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_86,negated_conjecture,
'empty:Tree' != sK3,
inference(cnf_transformation,[],[f75]) ).
cnf(c_87,negated_conjecture,
searchtree(sK3),
inference(cnf_transformation,[],[f74]) ).
cnf(c_1805,plain,
'left:(Tree)>Tree'(sK3) = sP1_iProver_def,
definition ).
cnf(c_1806,plain,
'right:(Tree)>Tree'(sK3) = sP2_iProver_def,
definition ).
cnf(c_1807,negated_conjecture,
searchtree(sK3),
inference(demodulation,[status(thm)],[c_87]) ).
cnf(c_1808,negated_conjecture,
'empty:Tree' != sK3,
inference(demodulation,[status(thm)],[c_86]) ).
cnf(c_1812,negated_conjecture,
( ~ searchtree(sP1_iProver_def)
| ~ searchtree(sP2_iProver_def) ),
inference(demodulation,[status(thm)],[c_82]) ).
cnf(c_2617,plain,
sP0(sK3),
inference(superposition,[status(thm)],[c_1807,c_81]) ).
cnf(c_2846,plain,
( ~ sP0(sK3)
| 'empty:Tree' = sK3
| searchtree(sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_1806,c_78]) ).
cnf(c_2848,plain,
searchtree(sP2_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_2846,c_1808,c_2617]) ).
cnf(c_2864,plain,
( ~ sP0(sK3)
| 'empty:Tree' = sK3
| searchtree(sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_1805,c_79]) ).
cnf(c_2866,plain,
searchtree(sP1_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_2864,c_1808,c_2617]) ).
cnf(c_2873,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2866,c_2848,c_1812]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWW679_1 : TPTP v8.2.0. Released v6.4.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Wed Jun 19 06:55:39 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running TFA theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.63/1.09 % SZS status Started for theBenchmark.p
% 2.63/1.09 % SZS status Theorem for theBenchmark.p
% 2.63/1.09
% 2.63/1.09 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.63/1.09
% 2.63/1.09 ------ iProver source info
% 2.63/1.09
% 2.63/1.09 git: date: 2024-06-12 09:56:46 +0000
% 2.63/1.09 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.63/1.09 git: non_committed_changes: false
% 2.63/1.09
% 2.63/1.09 ------ Parsing...
% 2.63/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.63/1.09
% 2.63/1.09 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.63/1.09
% 2.63/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.63/1.09
% 2.63/1.09 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.63/1.09 ------ Proving...
% 2.63/1.09 ------ Problem Properties
% 2.63/1.09
% 2.63/1.09
% 2.63/1.09 clauses 42
% 2.63/1.09 conjectures 6
% 2.63/1.09 EPR 14
% 2.63/1.09 Horn 28
% 2.63/1.09 unary 20
% 2.63/1.09 binary 9
% 2.63/1.09 lits 89
% 2.63/1.09 lits eq 27
% 2.63/1.09 fd_pure 0
% 2.63/1.09 fd_pseudo 0
% 2.63/1.09 fd_cond 7
% 2.63/1.09 fd_pseudo_cond 2
% 2.63/1.09 AC symbols 1
% 2.63/1.09
% 2.63/1.09 ------ Input Options Time Limit: Unbounded
% 2.63/1.09
% 2.63/1.09
% 2.63/1.09 ------
% 2.63/1.09 Current options:
% 2.63/1.09 ------
% 2.63/1.09
% 2.63/1.09
% 2.63/1.09
% 2.63/1.09
% 2.63/1.09 ------ Proving...
% 2.63/1.09
% 2.63/1.09
% 2.63/1.09 % SZS status Theorem for theBenchmark.p
% 2.63/1.09
% 2.63/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.63/1.09
% 2.63/1.09
%------------------------------------------------------------------------------