TSTP Solution File: KLE010+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE010+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:39 EDT 2023
% Result : Theorem 78.62s 11.37s
% Output : CNFRefutation 78.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 92 ( 47 unt; 0 def)
% Number of atoms : 184 ( 69 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 155 ( 63 ~; 46 |; 30 &)
% ( 8 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 130 ( 4 sgn; 76 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f2,axiom,
! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_idempotence) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_distributivity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f13,axiom,
! [X3] :
( test(X3)
<=> ? [X4] : complement(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_1) ).
fof(f14,axiom,
! [X3,X4] :
( complement(X4,X3)
<=> ( one = addition(X3,X4)
& zero = multiplication(X4,X3)
& zero = multiplication(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_2) ).
fof(f15,axiom,
! [X3,X4] :
( test(X3)
=> ( c(X3) = X4
<=> complement(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_3) ).
fof(f19,conjecture,
! [X3,X4] :
( ( test(X3)
& test(X4) )
=> ( leq(addition(addition(addition(addition(multiplication(X4,X3),multiplication(c(X4),X3)),multiplication(X3,X4)),multiplication(c(X3),X4)),multiplication(c(X3),c(X4))),one)
& leq(one,addition(addition(addition(addition(multiplication(X4,X3),multiplication(c(X4),X3)),multiplication(X3,X4)),multiplication(c(X3),X4)),multiplication(c(X3),c(X4)))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X3,X4] :
( ( test(X3)
& test(X4) )
=> ( leq(addition(addition(addition(addition(multiplication(X4,X3),multiplication(c(X4),X3)),multiplication(X3,X4)),multiplication(c(X3),X4)),multiplication(c(X3),c(X4))),one)
& leq(one,addition(addition(addition(addition(multiplication(X4,X3),multiplication(c(X4),X3)),multiplication(X3,X4)),multiplication(c(X3),X4)),multiplication(c(X3),c(X4)))) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f22,plain,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ),
inference(rectify,[],[f13]) ).
fof(f23,plain,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f24,plain,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f28,plain,
~ ! [X0,X1] :
( ( test(X0)
& test(X1) )
=> ( leq(addition(addition(addition(addition(multiplication(X1,X0),multiplication(c(X1),X0)),multiplication(X0,X1)),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))),one)
& leq(one,addition(addition(addition(addition(multiplication(X1,X0),multiplication(c(X1),X0)),multiplication(X0,X1)),multiplication(c(X0),X1)),multiplication(c(X0),c(X1)))) ) ),
inference(rectify,[],[f20]) ).
fof(f29,plain,
! [X0,X1] :
( addition(X0,X1) = X1
=> leq(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f30,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(ennf_transformation,[],[f29]) ).
fof(f31,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f37,plain,
? [X0,X1] :
( ( ~ leq(addition(addition(addition(addition(multiplication(X1,X0),multiplication(c(X1),X0)),multiplication(X0,X1)),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))),one)
| ~ leq(one,addition(addition(addition(addition(multiplication(X1,X0),multiplication(c(X1),X0)),multiplication(X0,X1)),multiplication(c(X0),X1)),multiplication(c(X0),c(X1)))) )
& test(X0)
& test(X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f38,plain,
? [X0,X1] :
( ( ~ leq(addition(addition(addition(addition(multiplication(X1,X0),multiplication(c(X1),X0)),multiplication(X0,X1)),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))),one)
| ~ leq(one,addition(addition(addition(addition(multiplication(X1,X0),multiplication(c(X1),X0)),multiplication(X0,X1)),multiplication(c(X0),X1)),multiplication(c(X0),c(X1)))) )
& test(X0)
& test(X1) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X1] : complement(X1,X0)
| ~ test(X0) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f40,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X2] : complement(X2,X0)
| ~ test(X0) ) ),
inference(rectify,[],[f39]) ).
fof(f41,plain,
! [X0] :
( ? [X2] : complement(X2,X0)
=> complement(sK0(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( complement(sK0(X0),X0)
| ~ test(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f40,f41]) ).
fof(f43,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,[],[f23]) ).
fof(f44,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,[],[f43]) ).
fof(f45,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f31]) ).
fof(f46,plain,
( ? [X0,X1] :
( ( ~ leq(addition(addition(addition(addition(multiplication(X1,X0),multiplication(c(X1),X0)),multiplication(X0,X1)),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))),one)
| ~ leq(one,addition(addition(addition(addition(multiplication(X1,X0),multiplication(c(X1),X0)),multiplication(X0,X1)),multiplication(c(X0),X1)),multiplication(c(X0),c(X1)))) )
& test(X0)
& test(X1) )
=> ( ( ~ leq(addition(addition(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),multiplication(sK1,sK2)),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2))),one)
| ~ leq(one,addition(addition(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),multiplication(sK1,sK2)),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2)))) )
& test(sK1)
& test(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f47,plain,
( ( ~ leq(addition(addition(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),multiplication(sK1,sK2)),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2))),one)
| ~ leq(one,addition(addition(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),multiplication(sK1,sK2)),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2)))) )
& test(sK1)
& test(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f38,f46]) ).
fof(f48,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f49,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f21]) ).
fof(f51,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f53,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f54,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f55,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f56,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f59,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f60,plain,
! [X0] :
( complement(sK0(X0),X0)
| ~ test(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f64,plain,
! [X0,X1] :
( addition(X0,X1) = one
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f66,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f45]) ).
fof(f71,plain,
test(sK2),
inference(cnf_transformation,[],[f47]) ).
fof(f72,plain,
test(sK1),
inference(cnf_transformation,[],[f47]) ).
fof(f73,plain,
( ~ leq(addition(addition(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),multiplication(sK1,sK2)),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2))),one)
| ~ leq(one,addition(addition(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),multiplication(sK1,sK2)),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2)))) ),
inference(cnf_transformation,[],[f47]) ).
fof(f74,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f66]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f48]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f49]) ).
cnf(c_52,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f51]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f53]) ).
cnf(c_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f54]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f55]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f56]) ).
cnf(c_60,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
cnf(c_62,plain,
( ~ test(X0)
| complement(sK0(X0),X0) ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_64,plain,
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_68,plain,
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(cnf_transformation,[],[f74]) ).
cnf(c_72,negated_conjecture,
( ~ leq(addition(addition(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),multiplication(sK1,sK2)),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2))),one)
| ~ leq(one,addition(addition(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),multiplication(sK1,sK2)),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2)))) ),
inference(cnf_transformation,[],[f73]) ).
cnf(c_73,negated_conjecture,
test(sK1),
inference(cnf_transformation,[],[f72]) ).
cnf(c_74,negated_conjecture,
test(sK2),
inference(cnf_transformation,[],[f71]) ).
cnf(c_95,negated_conjecture,
( ~ leq(addition(multiplication(sK2,sK1),addition(multiplication(sK1,sK2),addition(multiplication(c(sK2),sK1),addition(multiplication(c(sK1),sK2),multiplication(c(sK1),c(sK2)))))),one)
| ~ leq(one,addition(multiplication(sK2,sK1),addition(multiplication(sK1,sK2),addition(multiplication(c(sK2),sK1),addition(multiplication(c(sK1),sK2),multiplication(c(sK1),c(sK2))))))) ),
inference(theory_normalisation,[status(thm)],[c_72,c_50,c_49]) ).
cnf(c_240,plain,
( ~ leq(addition(multiplication(sK2,sK1),addition(multiplication(sK1,sK2),addition(multiplication(c(sK2),sK1),multiplication(c(sK1),addition(c(sK2),sK2))))),one)
| ~ leq(one,addition(multiplication(sK2,sK1),addition(multiplication(sK1,sK2),addition(multiplication(c(sK2),sK1),multiplication(c(sK1),addition(c(sK2),sK2)))))) ),
inference(ac_demodulation,[status(thm)],[c_95,c_56,c_56,c_50,c_49]) ).
cnf(c_241,plain,
( ~ leq(addition(multiplication(sK1,sK2),addition(multiplication(c(sK1),addition(c(sK2),sK2)),multiplication(addition(c(sK2),sK2),sK1))),one)
| ~ leq(one,addition(multiplication(sK1,sK2),addition(multiplication(c(sK1),addition(c(sK2),sK2)),multiplication(addition(c(sK2),sK2),sK1)))) ),
inference(ac_demodulation,[status(thm)],[c_240,c_57,c_57,c_50,c_49]) ).
cnf(c_242,plain,
( ~ leq(addition(multiplication(sK1,sK2),addition(multiplication(addition(sK2,c(sK2)),sK1),multiplication(c(sK1),addition(sK2,c(sK2))))),one)
| ~ leq(one,addition(multiplication(sK1,sK2),addition(multiplication(addition(sK2,c(sK2)),sK1),multiplication(c(sK1),addition(sK2,c(sK2)))))) ),
inference(theory_normalisation,[status(thm)],[c_241,c_50,c_49]) ).
cnf(c_204816,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_204877,plain,
( ~ test(X0)
| addition(X0,sK0(X0)) = one ),
inference(superposition,[status(thm)],[c_62,c_64]) ).
cnf(c_204951,plain,
leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_204816,c_60]) ).
cnf(c_204962,plain,
leq(addition(X0,X1),addition(X0,addition(X1,X2))),
inference(superposition,[status(thm)],[c_50,c_204951]) ).
cnf(c_205015,plain,
leq(addition(X0,X1),addition(X0,addition(X2,X1))),
inference(superposition,[status(thm)],[c_49,c_204962]) ).
cnf(c_205818,plain,
addition(sK1,sK0(sK1)) = one,
inference(superposition,[status(thm)],[c_73,c_204877]) ).
cnf(c_205819,plain,
addition(sK2,sK0(sK2)) = one,
inference(superposition,[status(thm)],[c_74,c_204877]) ).
cnf(c_205903,plain,
addition(sK1,one) = one,
inference(superposition,[status(thm)],[c_205818,c_204816]) ).
cnf(c_205926,plain,
addition(one,sK1) = one,
inference(theory_normalisation,[status(thm)],[c_205903,c_50,c_49]) ).
cnf(c_205958,plain,
addition(sK2,one) = one,
inference(superposition,[status(thm)],[c_205819,c_204816]) ).
cnf(c_205981,plain,
addition(one,sK2) = one,
inference(theory_normalisation,[status(thm)],[c_205958,c_50,c_49]) ).
cnf(c_219464,plain,
addition(multiplication(one,X0),multiplication(sK1,X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_205926,c_57]) ).
cnf(c_219560,plain,
addition(X0,multiplication(sK1,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_219464,c_55]) ).
cnf(c_221157,plain,
leq(addition(X0,multiplication(sK1,X1)),addition(X0,X1)),
inference(superposition,[status(thm)],[c_219560,c_205015]) ).
cnf(c_231119,plain,
leq(addition(one,multiplication(sK1,sK2)),one),
inference(superposition,[status(thm)],[c_205981,c_221157]) ).
cnf(c_378900,plain,
( ~ test(X0)
| addition(c(X0),X0) = one ),
inference(superposition,[status(thm)],[c_68,c_64]) ).
cnf(c_378901,plain,
( ~ test(X0)
| addition(X0,c(X0)) = one ),
inference(theory_normalisation,[status(thm)],[c_378900,c_50,c_49]) ).
cnf(c_378964,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_379074,plain,
addition(X0,multiplication(X1,one)) = multiplication(addition(X0,X1),one),
inference(superposition,[status(thm)],[c_54,c_57]) ).
cnf(c_379838,plain,
addition(sK1,c(sK1)) = one,
inference(superposition,[status(thm)],[c_73,c_378901]) ).
cnf(c_379839,plain,
addition(sK2,c(sK2)) = one,
inference(superposition,[status(thm)],[c_74,c_378901]) ).
cnf(c_379847,plain,
( ~ leq(addition(multiplication(sK1,sK2),addition(multiplication(one,sK1),multiplication(c(sK1),one))),one)
| ~ leq(one,addition(multiplication(sK1,sK2),addition(multiplication(one,sK1),multiplication(c(sK1),one)))) ),
inference(demodulation,[status(thm)],[c_242,c_379839]) ).
cnf(c_380131,plain,
( ~ leq(addition(multiplication(sK1,sK2),one),one)
| ~ leq(one,addition(multiplication(sK1,sK2),one)) ),
inference(demodulation,[status(thm)],[c_379847,c_54,c_55,c_379838,c_379074]) ).
cnf(c_380134,plain,
( ~ leq(addition(one,multiplication(sK1,sK2)),one)
| ~ leq(one,addition(one,multiplication(sK1,sK2))) ),
inference(theory_normalisation,[status(thm)],[c_380131,c_50,c_49]) ).
cnf(c_382781,plain,
leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_378964,c_60]) ).
cnf(c_382820,plain,
~ leq(addition(one,multiplication(sK1,sK2)),one),
inference(backward_subsumption_resolution,[status(thm)],[c_380134,c_382781]) ).
cnf(c_382821,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_382820,c_231119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE010+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n008.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 29 11:46:17 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 78.62/11.37 % SZS status Started for theBenchmark.p
% 78.62/11.37 % SZS status Theorem for theBenchmark.p
% 78.62/11.37
% 78.62/11.37 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 78.62/11.37
% 78.62/11.37 ------ iProver source info
% 78.62/11.37
% 78.62/11.37 git: date: 2023-05-31 18:12:56 +0000
% 78.62/11.37 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 78.62/11.37 git: non_committed_changes: false
% 78.62/11.37 git: last_make_outside_of_git: false
% 78.62/11.37
% 78.62/11.37 ------ Parsing...
% 78.62/11.37 ------ Clausification by vclausify_rel & Parsing by iProver...
% 78.62/11.37
% 78.62/11.37 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e
% 78.62/11.37
% 78.62/11.37 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 78.62/11.37
% 78.62/11.37 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 78.62/11.37 ------ Proving...
% 78.62/11.37 ------ Problem Properties
% 78.62/11.37
% 78.62/11.37
% 78.62/11.37 clauses 26
% 78.62/11.37 conjectures 2
% 78.62/11.37 EPR 3
% 78.62/11.37 Horn 25
% 78.62/11.37 unary 13
% 78.62/11.37 binary 9
% 78.62/11.37 lits 44
% 78.62/11.37 lits eq 22
% 78.62/11.37 fd_pure 0
% 78.62/11.37 fd_pseudo 0
% 78.62/11.37 fd_cond 0
% 78.62/11.37 fd_pseudo_cond 1
% 78.62/11.37 AC symbols 1
% 78.62/11.37
% 78.62/11.37 ------ Schedule dynamic 5 is on
% 78.62/11.37
% 78.62/11.37 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 78.62/11.37
% 78.62/11.37
% 78.62/11.37 ------
% 78.62/11.37 Current options:
% 78.62/11.37 ------
% 78.62/11.37
% 78.62/11.37
% 78.62/11.37
% 78.62/11.37
% 78.62/11.37 ------ Proving...
% 78.62/11.37 Proof_search_loop: time out after: 11161 full_loop iterations
% 78.62/11.37
% 78.62/11.37 ------ Input Options"--res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 78.62/11.37
% 78.62/11.37
% 78.62/11.37 ------
% 78.62/11.37 Current options:
% 78.62/11.37 ------
% 78.62/11.37
% 78.62/11.37
% 78.62/11.37
% 78.62/11.37
% 78.62/11.37 ------ Proving...
% 78.62/11.37
% 78.62/11.37
% 78.62/11.37 % SZS status Theorem for theBenchmark.p
% 78.62/11.37
% 78.62/11.37 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 78.62/11.37
% 78.62/11.38
%------------------------------------------------------------------------------