%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE020+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n012.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 01:52:10 PM UTC 2026
% Result : Theorem 11.69s 2.48s
% Output : CNFRefutation 11.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 92 ( 55 unt; 0 def)
% Number of atoms : 170 ( 79 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 129 ( 51 ~; 42 |; 27 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 124 ( 0 sgn 115 !; 9 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(f13,axiom,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(f14,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(f15,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(f17,conjecture,
! [X0,X1,X2] :
( ( test(X2)
& test(X1)
& test(X0) )
=> ( leq(multiplication(addition(X0,X1),addition(X0,X2)),addition(X0,multiplication(X1,X2)))
& leq(addition(X0,multiplication(X1,X2)),multiplication(addition(X0,X1),addition(X0,X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2] :
( ( test(X2)
& test(X1)
& test(X0) )
=> ( leq(multiplication(addition(X0,X1),addition(X0,X2)),addition(X0,multiplication(X1,X2)))
& leq(addition(X0,multiplication(X1,X2)),multiplication(addition(X0,X1),addition(X0,X2))) ) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( addition(X0,X1) = X1
=> leq(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f20,plain,
? [X0,X1,X2] :
( test(X2)
& test(X1)
& test(X0)
& ( ~ leq(multiplication(addition(X0,X1),addition(X0,X2)),addition(X0,multiplication(X1,X2)))
| ~ leq(addition(X0,multiplication(X1,X2)),multiplication(addition(X0,X1),addition(X0,X2))) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f21,plain,
? [X0,X1,X2] :
( test(X2)
& test(X1)
& test(X0)
& ( ~ leq(multiplication(addition(X0,X1),addition(X0,X2)),addition(X0,multiplication(X1,X2)))
| ~ leq(addition(X0,multiplication(X1,X2)),multiplication(addition(X0,X1),addition(X0,X2))) ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f23,plain,
! [X0,X1] :
( ~ test(X0)
| ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f25,plain,
( test(sK2)
& test(sK1)
& test(sK0)
& ( ~ leq(multiplication(addition(sK0,sK1),addition(sK0,sK2)),addition(sK0,multiplication(sK1,sK2)))
| ~ leq(addition(sK0,multiplication(sK1,sK2)),multiplication(addition(sK0,sK1),addition(sK0,sK2))) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f21]) ).
fof(f26,plain,
! [X0] :
( ( ~ test(X0)
| ? [X1] : complement(X1,X0) )
& ( ! [X1] : ~ complement(X1,X0)
| test(X0) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f27,plain,
! [X0] :
( ( ~ test(X0)
| ? [X2] : complement(X2,X0) )
& ( ! [X1] : ~ complement(X1,X0)
| test(X0) ) ),
inference(rectify,[],[f26]) ).
fof(f28,plain,
! [X0] :
( ( ~ test(X0)
| complement(sK3(X0),X0) )
& ( ! [X1] : ~ complement(X1,X0)
| test(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0))],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ~ test(X0)
| ( ( c(X0) != X1
| complement(X0,X1) )
& ( ~ complement(X0,X1)
| c(X0) = X1 ) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f30,plain,
! [X0,X1] :
( ( ~ complement(X1,X0)
| ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) )
& ( addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1)
| complement(X1,X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f31,plain,
! [X0,X1] :
( ( ~ complement(X1,X0)
| ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) )
& ( addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1)
| complement(X1,X0) ) ),
inference(flattening,[],[f30]) ).
fof(f32,plain,
test(sK2),
inference(cnf_transformation,[],[f25]) ).
fof(f33,plain,
test(sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f34,plain,
test(sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f35,plain,
( ~ leq(multiplication(addition(sK0,sK1),addition(sK0,sK2)),addition(sK0,multiplication(sK1,sK2)))
| ~ leq(addition(sK0,multiplication(sK1,sK2)),multiplication(addition(sK0,sK1),addition(sK0,sK2))) ),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f38,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f39,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f40,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f41,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f42,plain,
! [X0] :
( ~ test(X0)
| complement(sK3(X0),X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f45,plain,
! [X0,X1] :
( ~ test(X0)
| c(X0) != X1
| complement(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f47,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f31]) ).
fof(f49,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| zero = multiplication(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f54,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f55,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f56,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f57,plain,
! [X0] :
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(equality_resolution,[],[f45]) ).
tcf(c_49,negated_conjecture,
( ~ leq(addition(sK0,multiplication(sK1,sK2)),multiplication(addition(sK0,sK1),addition(sK0,sK2)))
| ~ leq(multiplication(addition(sK0,sK1),addition(sK0,sK2)),addition(sK0,multiplication(sK1,sK2))) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_50,negated_conjecture,
test(sK0),
inference(cnf_transformation,[],[f34]) ).
tcf(c_51,negated_conjecture,
test(sK1),
inference(cnf_transformation,[],[f33]) ).
tcf(c_52,negated_conjecture,
test(sK2),
inference(cnf_transformation,[],[f32]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f36]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f37]) ).
tcf(c_55,plain,
! [X0: $i] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f38]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f39]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f40]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ( addition(X0,X1) != X1 ) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_60,plain,
! [X0: $i] :
( complement(sK3(X0),X0)
| ~ test(X0) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_63,plain,
! [X0: $i] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( ( multiplication(X1,X0) = zero )
| ~ complement(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( ( addition(X1,X0) = one )
| ~ complement(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_71,plain,
! [X0: $i] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f54]) ).
tcf(c_72,plain,
! [X0: $i] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f55]) ).
tcf(c_73,plain,
! [X0: $i] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f56]) ).
tcf(c_764,plain,
! [X0: $i,X1: $i,X2: $i] : addition(X0,addition(X1,X2)) = addition(X1,addition(X0,X2)),
inference(superposition,[status(thm)],[c_56,c_57]) ).
tcf(c_767,plain,
( ~ leq(addition(sK0,multiplication(sK1,sK2)),addition(multiplication(sK0,sK0),addition(multiplication(sK1,sK0),addition(multiplication(sK0,sK2),multiplication(sK1,sK2)))))
| ~ leq(addition(multiplication(sK0,sK0),addition(multiplication(sK1,sK0),addition(multiplication(sK0,sK2),multiplication(sK1,sK2)))),addition(sK0,multiplication(sK1,sK2))) ),
inference(demodulation,[status(thm)],[c_49,c_53,c_54,c_56,c_764]) ).
tcf(c_810,plain,
! [X0: $i] : addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_57,c_71]) ).
tcf(c_822,plain,
! [X0: $i] : leq(X0,X0),
inference(superposition,[status(thm)],[c_55,c_58]) ).
tcf(c_840,plain,
! [X0: $i] :
( ( multiplication(X0,sK3(X0)) = zero )
| ~ test(X0) ),
inference(superposition,[status(thm)],[c_60,c_65]) ).
tcf(c_860,plain,
! [X0: $i] :
( ( addition(X0,sK3(X0)) = one )
| ~ test(X0) ),
inference(superposition,[status(thm)],[c_60,c_67]) ).
tcf(c_861,plain,
! [X0: $i] :
( ( addition(c(X0),X0) = one )
| ~ test(X0) ),
inference(superposition,[status(thm)],[c_63,c_67]) ).
tcf(c_862,plain,
! [X0: $i] :
( ( addition(X0,c(X0)) = one )
| ~ test(X0) ),
inference(theory_normalisation,[status(thm)],[c_861,c_56,c_57]) ).
tcf(c_888,plain,
! [X0: $i,X1: $i] : addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_55,c_56]) ).
tcf(c_1034,plain,
multiplication(sK0,sK3(sK0)) = zero,
inference(superposition,[status(thm)],[c_50,c_840]) ).
tcf(c_1415,plain,
addition(sK0,sK3(sK0)) = one,
inference(superposition,[status(thm)],[c_50,c_860]) ).
tcf(c_1437,plain,
! [X0: $i] : addition(multiplication(X0,sK0),multiplication(X0,sK3(sK0))) = multiplication(X0,one),
inference(superposition,[status(thm)],[c_1415,c_54]) ).
tcf(c_1442,plain,
! [X0: $i] : addition(multiplication(X0,sK0),multiplication(X0,sK3(sK0))) = X0,
inference(light_normalisation,[status(thm)],[c_1437,c_73]) ).
tcf(c_1817,plain,
addition(sK1,c(sK1)) = one,
inference(superposition,[status(thm)],[c_51,c_862]) ).
tcf(c_1818,plain,
addition(sK2,c(sK2)) = one,
inference(superposition,[status(thm)],[c_52,c_862]) ).
tcf(c_2195,plain,
addition(sK1,one) = one,
inference(superposition,[status(thm)],[c_1817,c_888]) ).
tcf(c_2196,plain,
addition(sK2,one) = one,
inference(superposition,[status(thm)],[c_1818,c_888]) ).
tcf(c_2208,plain,
addition(one,sK2) = one,
inference(theory_normalisation,[status(thm)],[c_2196,c_56,c_57]) ).
tcf(c_2209,plain,
addition(one,sK1) = one,
inference(theory_normalisation,[status(thm)],[c_2195,c_56,c_57]) ).
tcf(c_2668,plain,
! [X0: $i] : addition(multiplication(X0,one),multiplication(X0,sK2)) = multiplication(X0,one),
inference(superposition,[status(thm)],[c_2208,c_54]) ).
tcf(c_2674,plain,
! [X0: $i] : addition(X0,multiplication(X0,sK2)) = X0,
inference(light_normalisation,[status(thm)],[c_2668,c_73]) ).
tcf(c_3158,plain,
! [X0: $i] : addition(multiplication(one,X0),multiplication(sK1,X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_2209,c_53]) ).
tcf(c_3171,plain,
! [X0: $i] : addition(X0,multiplication(sK1,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_3158,c_72]) ).
tcf(c_4957,plain,
! [X0: $i,X1: $i] : addition(X0,addition(multiplication(X0,sK2),X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_2674,c_56]) ).
tcf(c_8738,plain,
! [X0: $i,X1: $i] : addition(X0,addition(multiplication(sK1,X0),X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_3171,c_56]) ).
tcf(c_46339,plain,
addition(multiplication(sK0,sK0),zero) = sK0,
inference(superposition,[status(thm)],[c_1034,c_1442]) ).
tcf(c_46401,plain,
addition(zero,multiplication(sK0,sK0)) = sK0,
inference(theory_normalisation,[status(thm)],[c_46339,c_56,c_57]) ).
tcf(c_56254,plain,
multiplication(sK0,sK0) = sK0,
inference(demodulation,[status(thm)],[c_46401,c_810]) ).
tcf(c_56262,plain,
( ~ leq(addition(sK0,multiplication(sK1,sK2)),addition(sK0,addition(multiplication(sK1,sK0),addition(multiplication(sK0,sK2),multiplication(sK1,sK2)))))
| ~ leq(addition(sK0,addition(multiplication(sK1,sK0),addition(multiplication(sK0,sK2),multiplication(sK1,sK2)))),addition(sK0,multiplication(sK1,sK2))) ),
inference(demodulation,[status(thm)],[c_767,c_56254]) ).
tcf(c_57028,plain,
~ leq(addition(sK0,multiplication(sK1,sK2)),addition(sK0,multiplication(sK1,sK2))),
inference(demodulation,[status(thm)],[c_56262,c_4957,c_8738]) ).
tcf(c_57029,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_57028,c_822]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : KLE020+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Wed Sep 23 18:37:06 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.03/0.32
% 0.03/0.32 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.32
% 0.03/0.33 % Detected problem language: tptp
% 0.07/0.33 % Proving...
% 11.69/2.48 % SZS status Started for theBenchmark.p
% 11.69/2.48 % SZS status Theorem for theBenchmark.p
% 11.69/2.48
% 11.69/2.48 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 11.69/2.48
% 11.69/2.48 % ------ iProver source info
% 11.69/2.48
% 11.69/2.48 % git: date: 2026-07-19 20:42:38 +0200
% 11.69/2.48 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 11.69/2.48 % git: non_committed_changes: false
% 11.69/2.48
% 11.69/2.48 % ------ Parsing...
% 11.69/2.48 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 11.69/2.48
% 11.69/2.48 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 11.69/2.48
% 11.69/2.48 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 11.69/2.48
% 11.69/2.48 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 11.69/2.48 % ------ Proving...
% 11.69/2.48 % ------ Problem Properties
% 11.69/2.48
% 11.69/2.48 %
% 11.69/2.48 % clauses 25
% 11.69/2.48 % conjectures 4
% 11.69/2.48 % EPR 4
% 11.69/2.48 % Horn 24
% 11.69/2.48 % unary 14
% 11.69/2.48 % binary 9
% 11.69/2.48 % lits 39
% 11.69/2.48 % lits eq 20
% 11.69/2.48 % fd_pure 0
% 11.69/2.48 % fd_pseudo 0
% 11.69/2.48 % fd_cond 0
% 11.69/2.48 % fd_pseudo_cond 1
% 11.69/2.48 % AC symbols 1
% 11.69/2.48
% 11.69/2.48 % ------ Schedule dynamic 5 is on
% 11.69/2.48
% 11.69/2.48 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 11.69/2.48
% 11.69/2.48
% 11.69/2.48 % ------
% 11.69/2.48 % Current options:
% 11.69/2.48 % ------
% 11.69/2.48
% 11.69/2.48
% 11.69/2.48 %
% 11.69/2.48
% 11.69/2.48 % ------ Proving...
% 11.69/2.48 %
% 11.69/2.48
% 11.69/2.48 % SZS status Theorem for theBenchmark.p
% 11.69/2.48
% 11.69/2.48 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.69/2.48
% 11.69/2.48
%------------------------------------------------------------------------------