TSTP Solution File: KLE027+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE027+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 : Thu Aug 31 05:31:47 EDT 2023
% Result : Theorem 3.99s 1.17s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of formulae : 78 ( 43 unt; 0 def)
% Number of atoms : 154 ( 70 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 128 ( 52 ~; 36 |; 27 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 123 ( 2 sgn; 79 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f2,axiom,
! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_distributivity) ).
fof(f11,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_annihilation) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f14,axiom,
! [X3,X4] :
( complement(X4,X3)
<=> ( one = addition(X3,X4)
& zero = multiplication(X4,X3)
& zero = multiplication(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_2) ).
fof(f15,axiom,
! [X3,X4] :
( test(X3)
=> ( c(X3) = X4
<=> complement(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_3) ).
fof(f17,conjecture,
! [X3,X4,X5,X6,X7] :
( ( test(X7)
& test(X6) )
=> ( leq(addition(multiplication(X6,X3),multiplication(c(X6),X5)),addition(multiplication(X6,addition(multiplication(X6,X3),multiplication(c(X6),X4))),multiplication(c(X6),X5)))
& leq(addition(multiplication(X6,addition(multiplication(X6,X3),multiplication(c(X6),X4))),multiplication(c(X6),X5)),addition(multiplication(X6,X3),multiplication(c(X6),X5))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X3,X4,X5,X6,X7] :
( ( test(X7)
& test(X6) )
=> ( leq(addition(multiplication(X6,X3),multiplication(c(X6),X5)),addition(multiplication(X6,addition(multiplication(X6,X3),multiplication(c(X6),X4))),multiplication(c(X6),X5)))
& leq(addition(multiplication(X6,addition(multiplication(X6,X3),multiplication(c(X6),X4))),multiplication(c(X6),X5)),addition(multiplication(X6,X3),multiplication(c(X6),X5))) ) ),
inference(negated_conjecture,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f21,plain,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f22,plain,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f24,plain,
~ ! [X0,X1,X2,X3,X4] :
( ( test(X4)
& test(X3) )
=> ( leq(addition(multiplication(X3,X0),multiplication(c(X3),X2)),addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)))
& leq(addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)),addition(multiplication(X3,X0),multiplication(c(X3),X2))) ) ),
inference(rectify,[],[f18]) ).
fof(f25,plain,
! [X0,X1] :
( addition(X0,X1) = X1
=> leq(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f26,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(ennf_transformation,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f29,plain,
? [X0,X1,X2,X3,X4] :
( ( ~ leq(addition(multiplication(X3,X0),multiplication(c(X3),X2)),addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)))
| ~ leq(addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)),addition(multiplication(X3,X0),multiplication(c(X3),X2))) )
& test(X4)
& test(X3) ),
inference(ennf_transformation,[],[f24]) ).
fof(f30,plain,
? [X0,X1,X2,X3,X4] :
( ( ~ leq(addition(multiplication(X3,X0),multiplication(c(X3),X2)),addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)))
| ~ leq(addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)),addition(multiplication(X3,X0),multiplication(c(X3),X2))) )
& test(X4)
& test(X3) ),
inference(flattening,[],[f29]) ).
fof(f35,plain,
! [X0,X1] :
( ( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) )
& ( ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f36,plain,
! [X0,X1] :
( ( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) )
& ( ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X1,X0) ) ),
inference(flattening,[],[f35]) ).
fof(f37,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f27]) ).
fof(f38,plain,
( ? [X0,X1,X2,X3,X4] :
( ( ~ leq(addition(multiplication(X3,X0),multiplication(c(X3),X2)),addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)))
| ~ leq(addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)),addition(multiplication(X3,X0),multiplication(c(X3),X2))) )
& test(X4)
& test(X3) )
=> ( ( ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)))
| ~ leq(addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3))) )
& test(sK5)
& test(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
( ( ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)))
| ~ leq(addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3))) )
& test(sK5)
& test(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f30,f38]) ).
fof(f40,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f41,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f19]) ).
fof(f42,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f43,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f44,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f45,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f47,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f50,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f51,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f26]) ).
fof(f55,plain,
! [X0,X1] :
( zero = multiplication(X1,X0)
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f56,plain,
! [X0,X1] :
( addition(X0,X1) = one
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f58,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f61,plain,
test(sK4),
inference(cnf_transformation,[],[f39]) ).
fof(f63,plain,
( ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)))
| ~ leq(addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3))) ),
inference(cnf_transformation,[],[f39]) ).
fof(f64,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f58]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f40]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f41]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f42]) ).
cnf(c_52,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f43]) ).
cnf(c_53,plain,
multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f44]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f45]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f47]) ).
cnf(c_59,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f50]) ).
cnf(c_60,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_64,plain,
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_65,plain,
( ~ complement(X0,X1)
| multiplication(X0,X1) = zero ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_68,plain,
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_70,negated_conjecture,
( ~ leq(addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)))
| ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3))) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_72,negated_conjecture,
test(sK4),
inference(cnf_transformation,[],[f61]) ).
cnf(c_91,negated_conjecture,
( ~ leq(addition(multiplication(c(sK4),sK3),multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2)))),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)))
| ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(c(sK4),sK3),multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))))) ),
inference(theory_normalisation,[status(thm)],[c_70,c_50,c_49]) ).
cnf(c_749,plain,
( ~ leq(addition(multiplication(c(sK4),sK3),addition(multiplication(sK4,multiplication(sK4,sK1)),multiplication(sK4,multiplication(c(sK4),sK2)))),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)))
| ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(c(sK4),sK3),addition(multiplication(sK4,multiplication(sK4,sK1)),multiplication(sK4,multiplication(c(sK4),sK2))))) ),
inference(demodulation,[status(thm)],[c_91,c_56]) ).
cnf(c_750,plain,
( ~ leq(addition(multiplication(sK4,multiplication(sK4,sK1)),addition(multiplication(c(sK4),sK3),multiplication(sK4,multiplication(c(sK4),sK2)))),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)))
| ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,multiplication(sK4,sK1)),addition(multiplication(c(sK4),sK3),multiplication(sK4,multiplication(c(sK4),sK2))))) ),
inference(theory_normalisation,[status(thm)],[c_749,c_50,c_49]) ).
cnf(c_753,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_772,plain,
complement(sK4,c(sK4)),
inference(superposition,[status(thm)],[c_72,c_68]) ).
cnf(c_810,plain,
leq(X0,X0),
inference(superposition,[status(thm)],[c_52,c_60]) ).
cnf(c_825,plain,
addition(c(sK4),sK4) = one,
inference(superposition,[status(thm)],[c_772,c_64]) ).
cnf(c_832,plain,
addition(sK4,c(sK4)) = one,
inference(theory_normalisation,[status(thm)],[c_825,c_50,c_49]) ).
cnf(c_848,plain,
multiplication(sK4,c(sK4)) = zero,
inference(superposition,[status(thm)],[c_772,c_65]) ).
cnf(c_919,plain,
multiplication(sK4,multiplication(c(sK4),X0)) = multiplication(zero,X0),
inference(superposition,[status(thm)],[c_848,c_53]) ).
cnf(c_926,plain,
multiplication(sK4,multiplication(c(sK4),X0)) = zero,
inference(light_normalisation,[status(thm)],[c_919,c_59]) ).
cnf(c_929,plain,
( ~ leq(addition(multiplication(sK4,multiplication(sK4,sK1)),addition(multiplication(c(sK4),sK3),zero)),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)))
| ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,multiplication(sK4,sK1)),addition(multiplication(c(sK4),sK3),zero))) ),
inference(demodulation,[status(thm)],[c_750,c_926]) ).
cnf(c_930,plain,
( ~ leq(addition(zero,addition(multiplication(sK4,multiplication(sK4,sK1)),multiplication(c(sK4),sK3))),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)))
| ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(zero,addition(multiplication(sK4,multiplication(sK4,sK1)),multiplication(c(sK4),sK3)))) ),
inference(theory_normalisation,[status(thm)],[c_929,c_50,c_49]) ).
cnf(c_1001,plain,
addition(multiplication(X0,sK4),multiplication(X0,c(sK4))) = multiplication(X0,one),
inference(superposition,[status(thm)],[c_832,c_56]) ).
cnf(c_1015,plain,
addition(multiplication(X0,sK4),multiplication(X0,c(sK4))) = X0,
inference(light_normalisation,[status(thm)],[c_1001,c_54]) ).
cnf(c_1237,plain,
( ~ leq(addition(multiplication(sK4,multiplication(sK4,sK1)),multiplication(c(sK4),sK3)),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)))
| ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,multiplication(sK4,sK1)),multiplication(c(sK4),sK3))) ),
inference(demodulation,[status(thm)],[c_930,c_753]) ).
cnf(c_1397,plain,
addition(multiplication(sK4,sK4),zero) = sK4,
inference(superposition,[status(thm)],[c_848,c_1015]) ).
cnf(c_1403,plain,
addition(zero,multiplication(sK4,sK4)) = sK4,
inference(theory_normalisation,[status(thm)],[c_1397,c_50,c_49]) ).
cnf(c_1466,plain,
multiplication(sK4,sK4) = sK4,
inference(demodulation,[status(thm)],[c_1403,c_753]) ).
cnf(c_1467,plain,
multiplication(sK4,multiplication(sK4,X0)) = multiplication(sK4,X0),
inference(superposition,[status(thm)],[c_1466,c_53]) ).
cnf(c_1471,plain,
~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3))),
inference(demodulation,[status(thm)],[c_1237,c_1467]) ).
cnf(c_1472,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1471,c_810]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE027+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 11:14:39 EDT 2023
% 0.14/0.35 % 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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.99/1.17 % SZS status Started for theBenchmark.p
% 3.99/1.17 % SZS status Theorem for theBenchmark.p
% 3.99/1.17
% 3.99/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.99/1.17
% 3.99/1.17 ------ iProver source info
% 3.99/1.17
% 3.99/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.99/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.99/1.17 git: non_committed_changes: false
% 3.99/1.17 git: last_make_outside_of_git: false
% 3.99/1.17
% 3.99/1.17 ------ Parsing...
% 3.99/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.99/1.17
% 3.99/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.99/1.17
% 3.99/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.99/1.17
% 3.99/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.99/1.17 ------ Proving...
% 3.99/1.17 ------ Problem Properties
% 3.99/1.17
% 3.99/1.17
% 3.99/1.17 clauses 24
% 3.99/1.17 conjectures 3
% 3.99/1.17 EPR 3
% 3.99/1.17 Horn 23
% 3.99/1.17 unary 13
% 3.99/1.17 binary 9
% 3.99/1.17 lits 38
% 3.99/1.17 lits eq 20
% 3.99/1.17 fd_pure 0
% 3.99/1.17 fd_pseudo 0
% 3.99/1.17 fd_cond 0
% 3.99/1.17 fd_pseudo_cond 1
% 3.99/1.17 AC symbols 1
% 3.99/1.17
% 3.99/1.17 ------ Schedule dynamic 5 is on
% 3.99/1.17
% 3.99/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.99/1.17
% 3.99/1.17
% 3.99/1.17 ------
% 3.99/1.17 Current options:
% 3.99/1.17 ------
% 3.99/1.17
% 3.99/1.17
% 3.99/1.17
% 3.99/1.17
% 3.99/1.17 ------ Proving...
% 3.99/1.17
% 3.99/1.17
% 3.99/1.17 % SZS status Theorem for theBenchmark.p
% 3.99/1.17
% 3.99/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.99/1.17
% 3.99/1.18
%------------------------------------------------------------------------------