TSTP Solution File: KLE148+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE148+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:32:17 EDT 2023
% Result : Theorem 4.14s 1.11s
% Output : CNFRefutation 4.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 37 unt; 0 def)
% Number of atoms : 51 ( 50 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 0 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 65 ( 4 sgn; 39 !; 4 ?)
% 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(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',distributivity1) ).
fof(f10,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infty_unfold1) ).
fof(f19,conjecture,
! [X3,X4] :
( zero = multiplication(X3,X4)
=> multiplication(X3,strong_iteration(X4)) = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X3,X4] :
( zero = multiplication(X3,X4)
=> multiplication(X3,strong_iteration(X4)) = X3 ),
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,X1] :
( zero = multiplication(X0,X1)
=> multiplication(X0,strong_iteration(X1)) = X0 ),
inference(rectify,[],[f20]) ).
fof(f26,plain,
? [X0,X1] :
( multiplication(X0,strong_iteration(X1)) != X0
& zero = multiplication(X0,X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f28,plain,
( ? [X0,X1] :
( multiplication(X0,strong_iteration(X1)) != X0
& zero = multiplication(X0,X1) )
=> ( sK0 != multiplication(sK0,strong_iteration(sK1))
& zero = multiplication(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
( sK0 != multiplication(sK0,strong_iteration(sK1))
& zero = multiplication(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f26,f28]) ).
fof(f30,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f31,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f21]) ).
fof(f32,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f34,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f35,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f39,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f44,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f49,plain,
zero = multiplication(sK0,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f50,plain,
sK0 != multiplication(sK0,strong_iteration(sK1)),
inference(cnf_transformation,[],[f29]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f30]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f31]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f32]) ).
cnf(c_53,plain,
multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f34]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f35]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f37]) ).
cnf(c_58,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f39]) ).
cnf(c_63,plain,
addition(multiplication(X0,strong_iteration(X0)),one) = strong_iteration(X0),
inference(cnf_transformation,[],[f44]) ).
cnf(c_68,negated_conjecture,
multiplication(sK0,strong_iteration(sK1)) != sK0,
inference(cnf_transformation,[],[f50]) ).
cnf(c_69,negated_conjecture,
multiplication(sK0,sK1) = zero,
inference(cnf_transformation,[],[f49]) ).
cnf(c_87,plain,
addition(one,multiplication(X0,strong_iteration(X0))) = strong_iteration(X0),
inference(theory_normalisation,[status(thm)],[c_63,c_50,c_49]) ).
cnf(c_521,plain,
multiplication(sK0,multiplication(sK1,X0)) = multiplication(zero,X0),
inference(superposition,[status(thm)],[c_69,c_53]) ).
cnf(c_524,plain,
multiplication(sK0,multiplication(sK1,X0)) = zero,
inference(demodulation,[status(thm)],[c_521,c_58]) ).
cnf(c_550,plain,
multiplication(sK0,addition(X0,multiplication(sK1,X1))) = addition(multiplication(sK0,X0),zero),
inference(superposition,[status(thm)],[c_524,c_56]) ).
cnf(c_564,plain,
multiplication(sK0,addition(X0,multiplication(sK1,X1))) = multiplication(sK0,X0),
inference(demodulation,[status(thm)],[c_550,c_51]) ).
cnf(c_3801,plain,
multiplication(sK0,strong_iteration(sK1)) = multiplication(sK0,one),
inference(superposition,[status(thm)],[c_87,c_564]) ).
cnf(c_3804,plain,
multiplication(sK0,strong_iteration(sK1)) = sK0,
inference(demodulation,[status(thm)],[c_3801,c_54]) ).
cnf(c_3813,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_68,c_3804]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : KLE148+1 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n002.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 29 12:52:35 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.14/1.11 % SZS status Started for theBenchmark.p
% 4.14/1.11 % SZS status Theorem for theBenchmark.p
% 4.14/1.11
% 4.14/1.11 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.14/1.11
% 4.14/1.11 ------ iProver source info
% 4.14/1.11
% 4.14/1.11 git: date: 2023-05-31 18:12:56 +0000
% 4.14/1.11 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.14/1.11 git: non_committed_changes: false
% 4.14/1.11 git: last_make_outside_of_git: false
% 4.14/1.11
% 4.14/1.11 ------ Parsing...
% 4.14/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.14/1.11
% 4.14/1.11 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 4.14/1.11
% 4.14/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.14/1.11
% 4.14/1.11 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.14/1.11 ------ Proving...
% 4.14/1.11 ------ Problem Properties
% 4.14/1.11
% 4.14/1.11
% 4.14/1.11 clauses 21
% 4.14/1.11 conjectures 2
% 4.14/1.11 EPR 0
% 4.14/1.11 Horn 21
% 4.14/1.11 unary 16
% 4.14/1.11 binary 5
% 4.14/1.11 lits 26
% 4.14/1.11 lits eq 18
% 4.14/1.11 fd_pure 0
% 4.14/1.11 fd_pseudo 0
% 4.14/1.11 fd_cond 0
% 4.14/1.11 fd_pseudo_cond 0
% 4.14/1.11 AC symbols 1
% 4.14/1.11
% 4.14/1.11 ------ Input Options Time Limit: Unbounded
% 4.14/1.11
% 4.14/1.11
% 4.14/1.11 ------
% 4.14/1.11 Current options:
% 4.14/1.11 ------
% 4.14/1.11
% 4.14/1.11
% 4.14/1.11
% 4.14/1.11
% 4.14/1.11 ------ Proving...
% 4.14/1.11
% 4.14/1.11
% 4.14/1.11 % SZS status Theorem for theBenchmark.p
% 4.14/1.11
% 4.14/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.14/1.11
% 4.14/1.11
%------------------------------------------------------------------------------