TSTP Solution File: KLE035+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE035+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:50 EDT 2023
% Result : Theorem 3.29s 1.17s
% Output : CNFRefutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 61 ( 42 unt; 0 def)
% Number of atoms : 111 ( 51 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 82 ( 32 ~; 15 |; 30 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn; 53 !; 12 ?)
% 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(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(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(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f17,conjecture,
! [X3,X4,X5,X6] :
( ( leq(multiplication(multiplication(X5,X4),c(X6)),zero)
& leq(multiplication(multiplication(X5,X3),c(X6)),zero)
& test(X5)
& test(X6) )
=> leq(multiplication(multiplication(X5,addition(X3,X4)),c(X6)),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X3,X4,X5,X6] :
( ( leq(multiplication(multiplication(X5,X4),c(X6)),zero)
& leq(multiplication(multiplication(X5,X3),c(X6)),zero)
& test(X5)
& test(X6) )
=> leq(multiplication(multiplication(X5,addition(X3,X4)),c(X6)),zero) ),
inference(negated_conjecture,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f24,plain,
~ ! [X0,X1,X2,X3] :
( ( leq(multiplication(multiplication(X2,X1),c(X3)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X2)
& test(X3) )
=> leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero) ),
inference(rectify,[],[f18]) ).
fof(f27,plain,
? [X0,X1,X2,X3] :
( ~ leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero)
& leq(multiplication(multiplication(X2,X1),c(X3)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X2)
& test(X3) ),
inference(ennf_transformation,[],[f24]) ).
fof(f28,plain,
? [X0,X1,X2,X3] :
( ~ leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero)
& leq(multiplication(multiplication(X2,X1),c(X3)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X2)
& test(X3) ),
inference(flattening,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f37,plain,
( ? [X0,X1,X2,X3] :
( ~ leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero)
& leq(multiplication(multiplication(X2,X1),c(X3)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X2)
& test(X3) )
=> ( ~ leq(multiplication(multiplication(sK3,addition(sK1,sK2)),c(sK4)),zero)
& leq(multiplication(multiplication(sK3,sK2),c(sK4)),zero)
& leq(multiplication(multiplication(sK3,sK1),c(sK4)),zero)
& test(sK3)
& test(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
( ~ leq(multiplication(multiplication(sK3,addition(sK1,sK2)),c(sK4)),zero)
& leq(multiplication(multiplication(sK3,sK2),c(sK4)),zero)
& leq(multiplication(multiplication(sK3,sK1),c(sK4)),zero)
& test(sK3)
& test(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f28,f37]) ).
fof(f39,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f40,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f43,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f46,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f47,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f50,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f51,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f63,plain,
leq(multiplication(multiplication(sK3,sK1),c(sK4)),zero),
inference(cnf_transformation,[],[f38]) ).
fof(f64,plain,
leq(multiplication(multiplication(sK3,sK2),c(sK4)),zero),
inference(cnf_transformation,[],[f38]) ).
fof(f65,plain,
~ leq(multiplication(multiplication(sK3,addition(sK1,sK2)),c(sK4)),zero),
inference(cnf_transformation,[],[f38]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f39]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f40]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f41]) ).
cnf(c_53,plain,
multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f43]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f46]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f47]) ).
cnf(c_60,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_61,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f50]) ).
cnf(c_71,negated_conjecture,
~ leq(multiplication(multiplication(sK3,addition(sK1,sK2)),c(sK4)),zero),
inference(cnf_transformation,[],[f65]) ).
cnf(c_72,negated_conjecture,
leq(multiplication(multiplication(sK3,sK2),c(sK4)),zero),
inference(cnf_transformation,[],[f64]) ).
cnf(c_73,negated_conjecture,
leq(multiplication(multiplication(sK3,sK1),c(sK4)),zero),
inference(cnf_transformation,[],[f63]) ).
cnf(c_93,plain,
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(prop_impl_just,[status(thm)],[c_60]) ).
cnf(c_94,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(renaming,[status(thm)],[c_93]) ).
cnf(c_95,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
cnf(c_284,plain,
leq(multiplication(sK3,multiplication(sK1,c(sK4))),zero),
inference(demodulation,[status(thm)],[c_73,c_53]) ).
cnf(c_285,plain,
leq(multiplication(sK3,multiplication(sK2,c(sK4))),zero),
inference(demodulation,[status(thm)],[c_72,c_53]) ).
cnf(c_286,plain,
~ leq(multiplication(sK3,multiplication(addition(sK1,sK2),c(sK4))),zero),
inference(demodulation,[status(thm)],[c_71,c_53]) ).
cnf(c_306,plain,
( multiplication(sK3,multiplication(sK1,c(sK4))) != X0
| X1 != zero
| addition(X0,X1) = X1 ),
inference(resolution_lifted,[status(thm)],[c_95,c_284]) ).
cnf(c_307,plain,
addition(multiplication(sK3,multiplication(sK1,c(sK4))),zero) = zero,
inference(unflattening,[status(thm)],[c_306]) ).
cnf(c_311,plain,
( multiplication(sK3,multiplication(sK2,c(sK4))) != X0
| X1 != zero
| addition(X0,X1) = X1 ),
inference(resolution_lifted,[status(thm)],[c_95,c_285]) ).
cnf(c_312,plain,
addition(multiplication(sK3,multiplication(sK2,c(sK4))),zero) = zero,
inference(unflattening,[status(thm)],[c_311]) ).
cnf(c_316,plain,
( multiplication(sK3,multiplication(addition(sK1,sK2),c(sK4))) != X0
| addition(X0,X1) != X1
| X1 != zero ),
inference(resolution_lifted,[status(thm)],[c_94,c_286]) ).
cnf(c_317,plain,
addition(multiplication(sK3,multiplication(addition(sK1,sK2),c(sK4))),zero) != zero,
inference(unflattening,[status(thm)],[c_316]) ).
cnf(c_860,plain,
addition(zero,multiplication(sK3,multiplication(sK1,c(sK4)))) = zero,
inference(theory_normalisation,[status(thm)],[c_307,c_50,c_49]) ).
cnf(c_861,plain,
addition(zero,multiplication(sK3,multiplication(sK2,c(sK4)))) = zero,
inference(theory_normalisation,[status(thm)],[c_312,c_50,c_49]) ).
cnf(c_862,plain,
addition(zero,multiplication(sK3,multiplication(addition(sK1,sK2),c(sK4)))) != zero,
inference(theory_normalisation,[status(thm)],[c_317,c_50,c_49]) ).
cnf(c_863,plain,
addition(zero,addition(multiplication(sK3,multiplication(sK1,c(sK4))),multiplication(sK3,multiplication(sK2,c(sK4))))) != zero,
inference(demodulation,[status(thm)],[c_862,c_56,c_57]) ).
cnf(c_866,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_870,plain,
multiplication(sK3,multiplication(sK1,c(sK4))) = zero,
inference(demodulation,[status(thm)],[c_860,c_866]) ).
cnf(c_871,plain,
multiplication(sK3,multiplication(sK2,c(sK4))) = zero,
inference(demodulation,[status(thm)],[c_861,c_866]) ).
cnf(c_872,plain,
addition(multiplication(sK3,multiplication(sK1,c(sK4))),multiplication(sK3,multiplication(sK2,c(sK4)))) != zero,
inference(demodulation,[status(thm)],[c_863,c_866]) ).
cnf(c_888,plain,
addition(zero,zero) != zero,
inference(light_normalisation,[status(thm)],[c_872,c_870,c_871]) ).
cnf(c_889,plain,
zero != zero,
inference(demodulation,[status(thm)],[c_888,c_866]) ).
cnf(c_890,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_889]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE035+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 12:09:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.29/1.17 % SZS status Started for theBenchmark.p
% 3.29/1.17 % SZS status Theorem for theBenchmark.p
% 3.29/1.17
% 3.29/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.29/1.17
% 3.29/1.17 ------ iProver source info
% 3.29/1.17
% 3.29/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.29/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.29/1.17 git: non_committed_changes: false
% 3.29/1.17 git: last_make_outside_of_git: false
% 3.29/1.17
% 3.29/1.17 ------ Parsing...
% 3.29/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.29/1.17
% 3.29/1.17 ------ Preprocessing... sup_sim: 3 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e
% 3.29/1.17
% 3.29/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.29/1.17
% 3.29/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.29/1.17 ------ Proving...
% 3.29/1.17 ------ Problem Properties
% 3.29/1.17
% 3.29/1.17
% 3.29/1.17 clauses 27
% 3.29/1.17 conjectures 2
% 3.29/1.17 EPR 3
% 3.29/1.17 Horn 26
% 3.29/1.17 unary 16
% 3.29/1.17 binary 9
% 3.29/1.17 lits 41
% 3.29/1.17 lits eq 26
% 3.29/1.17 fd_pure 0
% 3.29/1.17 fd_pseudo 0
% 3.29/1.17 fd_cond 0
% 3.29/1.17 fd_pseudo_cond 1
% 3.29/1.17 AC symbols 1
% 3.29/1.17
% 3.29/1.17 ------ Schedule dynamic 5 is on
% 3.29/1.17
% 3.29/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.29/1.17
% 3.29/1.17
% 3.29/1.17 ------
% 3.29/1.17 Current options:
% 3.29/1.17 ------
% 3.29/1.17
% 3.29/1.17
% 3.29/1.17
% 3.29/1.17
% 3.29/1.17 ------ Proving...
% 3.29/1.17
% 3.29/1.17
% 3.29/1.17 % SZS status Theorem for theBenchmark.p
% 3.29/1.17
% 3.29/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.29/1.17
% 3.29/1.18
%------------------------------------------------------------------------------