TSTP Solution File: CSR019+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CSR019+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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 05:12:01 EDT 2024
% Result : Theorem 4.15s 1.20s
% Output : CNFRefutation 4.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 81 ( 13 unt; 0 def)
% Number of atoms : 377 ( 155 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 454 ( 158 ~; 165 |; 115 &)
% ( 14 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 170 ( 1 sgn 116 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X3,X4,X1] :
( ( terminates(X3,X1,X4)
& happens(X3,X4) )
=> ~ holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_terminates_not_holds) ).
fof(f14,axiom,
! [X3,X1,X4] :
( terminates(X3,X1,X4)
<=> ( ( ~ happens(push,X4)
& spinning = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& spinning = X1
& push = X3 )
| ( happens(push,X4)
& backwards = X1
& pull = X3 )
| ( happens(push,X4)
& forwards = X1
& pull = X3 )
| ( ~ happens(push,X4)
& forwards = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& backwards = X1
& push = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',terminates_all_defn) ).
fof(f16,axiom,
! [X3,X4] :
( happens(X3,X4)
<=> ( ( n2 = X4
& push = X3 )
| ( n2 = X4
& pull = X3 )
| ( n1 = X4
& pull = X3 )
| ( n0 = X4
& push = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f25,axiom,
n2 = plus(n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
fof(f48,conjecture,
~ holdsAt(forwards,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_forwards_2) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(forwards,n2),
inference(negated_conjecture,[],[f48]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ( terminates(X0,X2,X1)
& happens(X0,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
inference(rectify,[],[f10]) ).
fof(f62,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& spinning = X1
& push = X0 )
| ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ( happens(push,X2)
& forwards = X1
& pull = X0 )
| ( ~ happens(push,X2)
& forwards = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ) ),
inference(rectify,[],[f14]) ).
fof(f64,plain,
! [X0,X1] :
( happens(X0,X1)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| ( n0 = X1
& push = X0 ) ) ),
inference(rectify,[],[f16]) ).
fof(f79,plain,
holdsAt(forwards,n2),
inference(flattening,[],[f49]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(ennf_transformation,[],[f58]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(flattening,[],[f96]) ).
fof(f106,plain,
! [X2,X1,X0] :
( sP2(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f107,plain,
! [X2,X1,X0] :
( sP3(X2,X1,X0)
<=> ( ~ happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f108,plain,
! [X2,X1,X0] :
( sP4(X2,X1,X0)
<=> ( happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f109,plain,
! [X2,X1,X0] :
( sP5(X2,X1,X0)
<=> ( happens(push,X2)
& backwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).
fof(f110,plain,
! [X2,X1,X0] :
( sP6(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& spinning = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f111,plain,
! [X2,X1,X0] :
( sP7(X2,X1,X0)
<=> ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP7])]) ).
fof(f112,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> sP7(X2,X1,X0) ),
inference(definition_folding,[],[f62,f111,f110,f109,f108,f107,f106]) ).
fof(f113,plain,
! [X1,X0] :
( sP8(X1,X0)
<=> ( n0 = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP8])]) ).
fof(f114,plain,
! [X1,X0] :
( sP9(X1,X0)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])]) ).
fof(f115,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP9(X1,X0) ),
inference(definition_folding,[],[f64,f114,f113]) ).
fof(f132,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| ( ( happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0)
& ~ sP3(X2,X1,X0)
& ~ sP2(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0)
| ~ sP7(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f111]) ).
fof(f133,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| ( ( happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0)
& ~ sP3(X2,X1,X0)
& ~ sP2(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0)
| ~ sP7(X2,X1,X0) ) ),
inference(flattening,[],[f132]) ).
fof(f134,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| ( ( happens(push,X0)
| spinning != X1
| pull != X2 )
& ~ sP6(X0,X1,X2)
& ~ sP5(X0,X1,X2)
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2) ) )
& ( ( ~ happens(push,X0)
& spinning = X1
& pull = X2 )
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| ~ sP7(X0,X1,X2) ) ),
inference(rectify,[],[f133]) ).
fof(f141,plain,
! [X2,X1,X0] :
( ( sP4(X2,X1,X0)
| ~ happens(push,X2)
| forwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& forwards = X1
& pull = X0 )
| ~ sP4(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f108]) ).
fof(f142,plain,
! [X2,X1,X0] :
( ( sP4(X2,X1,X0)
| ~ happens(push,X2)
| forwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& forwards = X1
& pull = X0 )
| ~ sP4(X2,X1,X0) ) ),
inference(flattening,[],[f141]) ).
fof(f143,plain,
! [X0,X1,X2] :
( ( sP4(X0,X1,X2)
| ~ happens(push,X0)
| forwards != X1
| pull != X2 )
& ( ( happens(push,X0)
& forwards = X1
& pull = X2 )
| ~ sP4(X0,X1,X2) ) ),
inference(rectify,[],[f142]) ).
fof(f144,plain,
! [X2,X1,X0] :
( ( sP3(X2,X1,X0)
| happens(push,X2)
| forwards != X1
| pull != X0 )
& ( ( ~ happens(push,X2)
& forwards = X1
& pull = X0 )
| ~ sP3(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f107]) ).
fof(f145,plain,
! [X2,X1,X0] :
( ( sP3(X2,X1,X0)
| happens(push,X2)
| forwards != X1
| pull != X0 )
& ( ( ~ happens(push,X2)
& forwards = X1
& pull = X0 )
| ~ sP3(X2,X1,X0) ) ),
inference(flattening,[],[f144]) ).
fof(f146,plain,
! [X0,X1,X2] :
( ( sP3(X0,X1,X2)
| happens(push,X0)
| forwards != X1
| pull != X2 )
& ( ( ~ happens(push,X0)
& forwards = X1
& pull = X2 )
| ~ sP3(X0,X1,X2) ) ),
inference(rectify,[],[f145]) ).
fof(f150,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ~ sP7(X2,X1,X0) )
& ( sP7(X2,X1,X0)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f112]) ).
fof(f151,plain,
! [X1,X0] :
( ( sP9(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP8(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0)
| ~ sP9(X1,X0) ) ),
inference(nnf_transformation,[],[f114]) ).
fof(f152,plain,
! [X1,X0] :
( ( sP9(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP8(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0)
| ~ sP9(X1,X0) ) ),
inference(flattening,[],[f151]) ).
fof(f153,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( n2 != X0
| push != X1 )
& ( n2 != X0
| pull != X1 )
& ( n1 != X0
| pull != X1 )
& ~ sP8(X0,X1) ) )
& ( ( n2 = X0
& push = X1 )
| ( n2 = X0
& pull = X1 )
| ( n1 = X0
& pull = X1 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(rectify,[],[f152]) ).
fof(f157,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X1,X0) )
& ( sP9(X1,X0)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f180,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f202,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| ~ sP3(X0,X1,X2) ),
inference(cnf_transformation,[],[f134]) ).
fof(f203,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| ~ sP4(X0,X1,X2) ),
inference(cnf_transformation,[],[f134]) ).
fof(f218,plain,
! [X2,X0,X1] :
( sP4(X0,X1,X2)
| ~ happens(push,X0)
| forwards != X1
| pull != X2 ),
inference(cnf_transformation,[],[f143]) ).
fof(f222,plain,
! [X2,X0,X1] :
( sP3(X0,X1,X2)
| happens(push,X0)
| forwards != X1
| pull != X2 ),
inference(cnf_transformation,[],[f146]) ).
fof(f228,plain,
! [X2,X0,X1] :
( terminates(X0,X1,X2)
| ~ sP7(X2,X1,X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f239,plain,
! [X0,X1] :
( sP9(X0,X1)
| n1 != X0
| pull != X1 ),
inference(cnf_transformation,[],[f153]) ).
fof(f246,plain,
! [X0,X1] :
( happens(X0,X1)
| ~ sP9(X1,X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f255,plain,
n2 = plus(n1,n1),
inference(cnf_transformation,[],[f25]) ).
fof(f291,plain,
holdsAt(forwards,n2),
inference(cnf_transformation,[],[f79]) ).
fof(f304,plain,
! [X2,X0] :
( sP4(X0,forwards,X2)
| ~ happens(push,X0)
| pull != X2 ),
inference(equality_resolution,[],[f218]) ).
fof(f305,plain,
! [X0] :
( sP4(X0,forwards,pull)
| ~ happens(push,X0) ),
inference(equality_resolution,[],[f304]) ).
fof(f306,plain,
! [X2,X0] :
( sP3(X0,forwards,X2)
| happens(push,X0)
| pull != X2 ),
inference(equality_resolution,[],[f222]) ).
fof(f307,plain,
! [X0] :
( sP3(X0,forwards,pull)
| happens(push,X0) ),
inference(equality_resolution,[],[f306]) ).
fof(f314,plain,
! [X1] :
( sP9(n1,X1)
| pull != X1 ),
inference(equality_resolution,[],[f239]) ).
fof(f315,plain,
sP9(n1,pull),
inference(equality_resolution,[],[f314]) ).
cnf(c_58,plain,
( ~ holdsAt(X0,plus(X1,n1))
| ~ terminates(X2,X0,X1)
| ~ happens(X2,X1) ),
inference(cnf_transformation,[],[f180]) ).
cnf(c_79,plain,
( ~ sP4(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(cnf_transformation,[],[f203]) ).
cnf(c_80,plain,
( ~ sP3(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(cnf_transformation,[],[f202]) ).
cnf(c_93,plain,
( ~ happens(push,X0)
| sP4(X0,forwards,pull) ),
inference(cnf_transformation,[],[f305]) ).
cnf(c_97,plain,
( sP3(X0,forwards,pull)
| happens(push,X0) ),
inference(cnf_transformation,[],[f307]) ).
cnf(c_105,plain,
( ~ sP7(X0,X1,X2)
| terminates(X2,X1,X0) ),
inference(cnf_transformation,[],[f228]) ).
cnf(c_110,plain,
sP9(n1,pull),
inference(cnf_transformation,[],[f315]) ).
cnf(c_123,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(cnf_transformation,[],[f246]) ).
cnf(c_133,plain,
plus(n1,n1) = n2,
inference(cnf_transformation,[],[f255]) ).
cnf(c_169,negated_conjecture,
holdsAt(forwards,n2),
inference(cnf_transformation,[],[f291]) ).
cnf(c_340,plain,
( ~ happens(push,X0)
| sP4(X0,forwards,pull) ),
inference(prop_impl_just,[status(thm)],[c_93]) ).
cnf(c_350,plain,
( happens(push,X0)
| sP3(X0,forwards,pull) ),
inference(prop_impl_just,[status(thm)],[c_97]) ).
cnf(c_351,plain,
( sP3(X0,forwards,pull)
| happens(push,X0) ),
inference(renaming,[status(thm)],[c_350]) ).
cnf(c_380,plain,
( ~ sP7(X0,X1,X2)
| terminates(X2,X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_105]) ).
cnf(c_404,plain,
( ~ sP4(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(prop_impl_just,[status(thm)],[c_79]) ).
cnf(c_412,plain,
( ~ sP3(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(prop_impl_just,[status(thm)],[c_80]) ).
cnf(c_436,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
cnf(c_1537,plain,
( X0 != X1
| X2 != X3
| X4 != X5
| ~ holdsAt(X0,plus(X2,n1))
| ~ sP7(X3,X1,X5)
| ~ happens(X4,X2) ),
inference(resolution_lifted,[status(thm)],[c_58,c_380]) ).
cnf(c_1538,plain,
( ~ holdsAt(X0,plus(X1,n1))
| ~ sP7(X1,X0,X2)
| ~ happens(X2,X1) ),
inference(unflattening,[status(thm)],[c_1537]) ).
cnf(c_1700,plain,
( X0 != X1
| X2 != forwards
| X3 != pull
| sP7(X0,X2,X3)
| happens(push,X1) ),
inference(resolution_lifted,[status(thm)],[c_412,c_351]) ).
cnf(c_1701,plain,
( sP7(X0,forwards,pull)
| happens(push,X0) ),
inference(unflattening,[status(thm)],[c_1700]) ).
cnf(c_2535,plain,
( X0 != n1
| X1 != pull
| happens(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_110,c_436]) ).
cnf(c_2536,plain,
happens(pull,n1),
inference(unflattening,[status(thm)],[c_2535]) ).
cnf(c_2943,plain,
( X0 != X1
| X2 != forwards
| X3 != pull
| ~ happens(push,X1)
| sP7(X0,X2,X3) ),
inference(resolution_lifted,[status(thm)],[c_404,c_340]) ).
cnf(c_2944,plain,
( ~ happens(push,X0)
| sP7(X0,forwards,pull) ),
inference(unflattening,[status(thm)],[c_2943]) ).
cnf(c_2946,plain,
sP7(X0,forwards,pull),
inference(global_subsumption_just,[status(thm)],[c_2944,c_1701,c_2944]) ).
cnf(c_8655,plain,
( ~ sP7(n1,X0,X1)
| ~ holdsAt(X0,n2)
| ~ happens(X1,n1) ),
inference(superposition,[status(thm)],[c_133,c_1538]) ).
cnf(c_8726,plain,
( ~ holdsAt(forwards,n2)
| ~ happens(pull,n1) ),
inference(superposition,[status(thm)],[c_2946,c_8655]) ).
cnf(c_8727,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8726,c_2536,c_169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR019+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jun 19 21:58:24 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.15/1.20 % SZS status Started for theBenchmark.p
% 4.15/1.20 % SZS status Theorem for theBenchmark.p
% 4.15/1.20
% 4.15/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.15/1.20
% 4.15/1.20 ------ iProver source info
% 4.15/1.20
% 4.15/1.20 git: date: 2024-06-12 09:56:46 +0000
% 4.15/1.20 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 4.15/1.20 git: non_committed_changes: false
% 4.15/1.20
% 4.15/1.20 ------ Parsing...
% 4.15/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.15/1.20
% 4.15/1.20 ------ Preprocessing... sup_sim: 2 sf_s rm: 3 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 10 0s sf_e pe_s pe_e
% 4.15/1.20
% 4.15/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.15/1.20
% 4.15/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.15/1.20 ------ Proving...
% 4.15/1.20 ------ Problem Properties
% 4.15/1.20
% 4.15/1.20
% 4.15/1.20 clauses 82
% 4.15/1.20 conjectures 1
% 4.15/1.20 EPR 65
% 4.15/1.20 Horn 56
% 4.15/1.20 unary 27
% 4.15/1.20 binary 31
% 4.15/1.20 lits 177
% 4.15/1.20 lits eq 54
% 4.15/1.20 fd_pure 0
% 4.15/1.20 fd_pseudo 0
% 4.15/1.20 fd_cond 18
% 4.15/1.20 fd_pseudo_cond 2
% 4.15/1.20 AC symbols 0
% 4.15/1.20
% 4.15/1.20 ------ Input Options Time Limit: Unbounded
% 4.15/1.20
% 4.15/1.20
% 4.15/1.20 ------
% 4.15/1.20 Current options:
% 4.15/1.20 ------
% 4.15/1.20
% 4.15/1.20
% 4.15/1.20
% 4.15/1.20
% 4.15/1.20 ------ Proving...
% 4.15/1.20
% 4.15/1.20
% 4.15/1.20 % SZS status Theorem for theBenchmark.p
% 4.15/1.20
% 4.15/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.15/1.20
% 4.15/1.21
%------------------------------------------------------------------------------