%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL526+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:06:50 PM UTC 2026
% Result : Theorem 17.98s 3.95s
% Output : CNFRefutation 17.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of formulae : 103 ( 44 unt; 0 def)
% Number of atoms : 186 ( 24 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 143 ( 60 ~; 57 |; 4 &)
% ( 7 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 111 ( 0 sgn 109 !; 2 ?; 47 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_1) ).
fof(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_2) ).
fof(f15,axiom,
( equivalence_3
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',equivalence_3) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_1) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_2) ).
fof(f48,axiom,
equivalence_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_equivalence_3) ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',use_substitution_of_equivalents) ).
fof(f53,axiom,
( substitution_strict_equiv
<=> ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',substitution_strict_equiv) ).
fof(f55,axiom,
( axiom_M
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',axiom_M) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
fof(f76,axiom,
( op_strict_equiv
=> ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax',op_strict_equiv) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+2.ax',km5_axiom_M) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f87,axiom,
op_strict_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_equiv) ).
fof(f88,conjecture,
substitution_strict_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_substitution_strict_equiv) ).
fof(f89,negated_conjecture,
~ substitution_strict_equiv,
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f90,plain,
~ substitution_strict_equiv,
inference(flattening,[],[f89]) ).
fof(f92,plain,
( axiom_M
=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f94,plain,
( ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 )
=> substitution_strict_equiv ),
inference(unused_predicate_definition_removal,[],[f53]) ).
fof(f96,plain,
( equivalence_3
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f103,plain,
( and_2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f104,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f109,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f110,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f115,plain,
( ~ modus_ponens
| ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ) ),
inference(ennf_transformation,[],[f110]) ).
fof(f116,plain,
( ~ modus_ponens
| ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ) ),
inference(flattening,[],[f115]) ).
fof(f117,plain,
( ~ substitution_of_equivalents
| ! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ) ),
inference(ennf_transformation,[],[f109]) ).
fof(f122,plain,
( ~ and_1
| ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f104]) ).
fof(f123,plain,
( ~ and_2
| ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(ennf_transformation,[],[f103]) ).
fof(f130,plain,
( ~ equivalence_3
| ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(ennf_transformation,[],[f96]) ).
fof(f135,plain,
( ? [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
& X0 != X1 )
| substitution_strict_equiv ),
inference(ennf_transformation,[],[f94]) ).
fof(f137,plain,
( ~ axiom_M
| ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
inference(ennf_transformation,[],[f92]) ).
fof(f140,plain,
( ~ op_strict_implies
| ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
inference(ennf_transformation,[],[f75]) ).
fof(f141,plain,
( ~ op_strict_equiv
| ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)) ),
inference(ennf_transformation,[],[f76]) ).
fof(f142,plain,
( ( is_a_theorem(strict_equiv(sK0,sK1))
& sK0 != sK1 )
| substitution_strict_equiv ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f135]) ).
fof(f143,plain,
! [X0,X1] :
( ~ modus_ponens
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f144,plain,
! [X0,X1] :
( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f117]) ).
fof(f149,plain,
! [X0,X1] :
( ~ and_1
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f122]) ).
fof(f150,plain,
! [X0,X1] :
( ~ and_2
| is_a_theorem(implies(and(X0,X1),X1)) ),
inference(cnf_transformation,[],[f123]) ).
fof(f157,plain,
! [X0,X1] :
( ~ equivalence_3
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(cnf_transformation,[],[f130]) ).
fof(f164,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f169,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f170,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f177,plain,
equivalence_3,
inference(cnf_transformation,[],[f48]) ).
fof(f178,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f180,plain,
( is_a_theorem(strict_equiv(sK0,sK1))
| substitution_strict_equiv ),
inference(cnf_transformation,[],[f142]) ).
fof(f181,plain,
( sK0 != sK1
| substitution_strict_equiv ),
inference(cnf_transformation,[],[f142]) ).
fof(f183,plain,
! [X0] :
( ~ axiom_M
| is_a_theorem(implies(necessarily(X0),X0)) ),
inference(cnf_transformation,[],[f137]) ).
fof(f186,plain,
! [X0,X1] :
( ~ op_strict_implies
| strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
inference(cnf_transformation,[],[f140]) ).
fof(f187,plain,
! [X0,X1] :
( ~ op_strict_equiv
| strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)) ),
inference(cnf_transformation,[],[f141]) ).
fof(f191,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f195,plain,
op_strict_implies,
inference(cnf_transformation,[],[f85]) ).
fof(f197,plain,
op_strict_equiv,
inference(cnf_transformation,[],[f87]) ).
fof(f198,plain,
~ substitution_strict_equiv,
inference(cnf_transformation,[],[f90]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f143]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X0,X1)) ),
inference(cnf_transformation,[],[f144]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[],[f149]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(cnf_transformation,[],[f157]) ).
tcf(c_70,plain,
modus_ponens,
inference(cnf_transformation,[],[f164]) ).
tcf(c_75,plain,
and_1,
inference(cnf_transformation,[],[f169]) ).
tcf(c_76,plain,
and_2,
inference(cnf_transformation,[],[f170]) ).
tcf(c_83,plain,
equivalence_3,
inference(cnf_transformation,[],[f177]) ).
tcf(c_84,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f178]) ).
tcf(c_86,plain,
( substitution_strict_equiv
| ( sK0 != sK1 ) ),
inference(cnf_transformation,[],[f181]) ).
tcf(c_87,plain,
( substitution_strict_equiv
| is_a_theorem(strict_equiv(sK0,sK1)) ),
inference(cnf_transformation,[],[f180]) ).
tcf(c_89,plain,
! [X0: $i] :
( is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(cnf_transformation,[],[f183]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i] :
( ( necessarily(implies(X0,X1)) = strict_implies(X0,X1) )
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f186]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i] :
( ( and(strict_implies(X0,X1),strict_implies(X1,X0)) = strict_equiv(X0,X1) )
| ~ op_strict_equiv ),
inference(cnf_transformation,[],[f187]) ).
tcf(c_97,plain,
axiom_M,
inference(cnf_transformation,[],[f191]) ).
tcf(c_101,plain,
op_strict_implies,
inference(cnf_transformation,[],[f195]) ).
tcf(c_103,plain,
op_strict_equiv,
inference(cnf_transformation,[],[f197]) ).
tcf(c_104,negated_conjecture,
~ substitution_strict_equiv,
inference(cnf_transformation,[],[f198]) ).
tcf(c_129,plain,
is_a_theorem(strict_equiv(sK0,sK1)),
inference(global_subsumption_just,[status(thm)],[c_87,c_104,c_87]) ).
tcf(c_131,plain,
sK0 != sK1,
inference(global_subsumption_just,[status(thm)],[c_86,c_104,c_86]) ).
tcf(c_133,plain,
! [X0: $i] : is_a_theorem(implies(necessarily(X0),X0)),
inference(global_subsumption_just,[status(thm)],[c_89,c_97,c_89]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(and(X0,X1),X1)),
inference(global_subsumption_just,[status(thm)],[c_56,c_76,c_56]) ).
tcf(c_147,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(and(X0,X1),X0)),
inference(global_subsumption_just,[status(thm)],[c_55,c_75,c_55]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i] : necessarily(implies(X0,X1)) = strict_implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_92,c_101,c_92]) ).
tcf(c_169,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ is_a_theorem(equiv(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_84,c_50]) ).
tcf(c_181,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_70,c_49]) ).
tcf(c_182,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(renaming,[status(thm)],[c_181]) ).
tcf(c_189,plain,
! [X0: $i,X1: $i] : and(strict_implies(X0,X1),strict_implies(X1,X0)) = strict_equiv(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_93,c_103,c_93]) ).
tcf(c_195,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))),
inference(global_subsumption_just,[status(thm)],[c_63,c_83,c_63]) ).
tcf(c_2447,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(and(X0,X1)) ),
inference(superposition,[status(thm)],[c_147,c_182]) ).
tcf(c_2448,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(and(X0,X1)) ),
inference(superposition,[status(thm)],[c_144,c_182]) ).
tcf(c_2454,plain,
! [X0: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(necessarily(X0)) ),
inference(superposition,[status(thm)],[c_133,c_182]) ).
tcf(c_2462,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(X1,X0),equiv(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_195,c_182]) ).
tcf(c_2471,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_166,c_2454]) ).
tcf(c_2478,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(strict_equiv(X0,X1)) ),
inference(superposition,[status(thm)],[c_189,c_2447]) ).
tcf(c_2482,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(strict_implies(X1,X0))
| ~ is_a_theorem(strict_equiv(X0,X1)) ),
inference(superposition,[status(thm)],[c_189,c_2448]) ).
tcf(c_2666,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equiv(X0,X1))
| ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_2462,c_182]) ).
tcf(c_2741,plain,
is_a_theorem(strict_implies(sK0,sK1)),
inference(superposition,[status(thm)],[c_129,c_2478]) ).
tcf(c_2744,plain,
is_a_theorem(strict_implies(sK1,sK0)),
inference(superposition,[status(thm)],[c_129,c_2482]) ).
tcf(c_2868,plain,
is_a_theorem(implies(sK0,sK1)),
inference(superposition,[status(thm)],[c_2741,c_2471]) ).
tcf(c_2869,plain,
is_a_theorem(implies(sK1,sK0)),
inference(superposition,[status(thm)],[c_2744,c_2471]) ).
tcf(c_5169,plain,
( is_a_theorem(equiv(sK0,sK1))
| ~ is_a_theorem(implies(sK0,sK1)) ),
inference(superposition,[status(thm)],[c_2869,c_2666]) ).
tcf(c_5173,plain,
is_a_theorem(equiv(sK0,sK1)),
inference(forward_subsumption_resolution,[status(thm)],[c_5169,c_2868]) ).
tcf(c_5883,plain,
sK0 = sK1,
inference(superposition,[status(thm)],[c_5173,c_169]) ).
tcf(c_5884,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5883,c_131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL526+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Wed Sep 23 23:38:57 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/0.44 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.46
% 0.12/0.46 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.46
% 0.12/0.47 % Detected problem language: tptp
% 0.20/0.48 % Proving...
% 17.98/3.95 % SZS status Started for theBenchmark.p
% 17.98/3.95 % SZS status Theorem for theBenchmark.p
% 17.98/3.95
% 17.98/3.95 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 17.98/3.95
% 17.98/3.95 % ------ iProver source info
% 17.98/3.95
% 17.98/3.95 % git: date: 2026-07-19 20:42:38 +0200
% 17.98/3.95 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 17.98/3.95 % git: non_committed_changes: false
% 17.98/3.95
% 17.98/3.95 % ------ Parsing...
% 17.98/3.95 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 17.98/3.95
% 17.98/3.95 % ------ Preprocessing... sup_sim: 2 sf_s rm: 27 0s sf_e pe_s pe_e sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e %
% 17.98/3.95
% 17.98/3.95 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 17.98/3.95
% 17.98/3.95 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 17.98/3.95 % ------ Proving...
% 17.98/3.95 % ------ Problem Properties
% 17.98/3.95
% 17.98/3.95 %
% 17.98/3.95 % clauses 27
% 17.98/3.95 % conjectures 0
% 17.98/3.95 % EPR 1
% 17.98/3.95 % Horn 27
% 17.98/3.95 % unary 24
% 17.98/3.95 % binary 2
% 17.98/3.95 % lits 31
% 17.98/3.95 % lits eq 8
% 17.98/3.95 % fd_pure 0
% 17.98/3.95 % fd_pseudo 0
% 17.98/3.95 % fd_cond 0
% 17.98/3.95 % fd_pseudo_cond 1
% 17.98/3.95 % AC symbols 0
% 17.98/3.95
% 17.98/3.95 % ------ Input Options Time Limit: Unbounded
% 17.98/3.95
% 17.98/3.95
% 17.98/3.95 % ------
% 17.98/3.95 % Current options:
% 17.98/3.95 % ------
% 17.98/3.95
% 17.98/3.95
% 17.98/3.95 %
% 17.98/3.95
% 17.98/3.95 % ------ Proving...
% 17.98/3.95 %
% 17.98/3.95
% 17.98/3.95 % SZS status Theorem for theBenchmark.p
% 17.98/3.95
% 17.98/3.95 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.98/3.95
% 17.98/3.95
%------------------------------------------------------------------------------