TSTP Solution File: KLE071+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE071+1 : 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:59 EDT 2023
% Result : Theorem 3.46s 1.14s
% Output : CNFRefutation 3.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 61 ( 60 unt; 0 def)
% Number of atoms : 62 ( 61 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 14 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 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 : 100 ( 8 sgn; 56 !; 6 ?)
% 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(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(f13,axiom,
! [X3] : multiplication(domain(X3),X3) = addition(X3,multiplication(domain(X3),X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain1) ).
fof(f14,axiom,
! [X3,X4] : domain(multiplication(X3,X4)) = domain(multiplication(X3,domain(X4))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain2) ).
fof(f15,axiom,
! [X3] : one = addition(domain(X3),one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain3) ).
fof(f17,axiom,
! [X3,X4] : domain(addition(X3,X4)) = addition(domain(X3),domain(X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain5) ).
fof(f18,conjecture,
! [X3,X4,X5] : addition(domain(X3),multiplication(domain(X4),domain(X5))) = multiplication(addition(domain(X3),domain(X4)),addition(domain(X3),domain(X5))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X3,X4,X5] : addition(domain(X3),multiplication(domain(X4),domain(X5))) = multiplication(addition(domain(X3),domain(X4)),addition(domain(X3),domain(X5))),
inference(negated_conjecture,[],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f21,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(rectify,[],[f13]) ).
fof(f22,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(rectify,[],[f14]) ).
fof(f23,plain,
! [X0] : one = addition(domain(X0),one),
inference(rectify,[],[f15]) ).
fof(f24,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(rectify,[],[f17]) ).
fof(f25,plain,
~ ! [X0,X1,X2] : addition(domain(X0),multiplication(domain(X1),domain(X2))) = multiplication(addition(domain(X0),domain(X1)),addition(domain(X0),domain(X2))),
inference(rectify,[],[f19]) ).
fof(f26,plain,
? [X0,X1,X2] : addition(domain(X0),multiplication(domain(X1),domain(X2))) != multiplication(addition(domain(X0),domain(X1)),addition(domain(X0),domain(X2))),
inference(ennf_transformation,[],[f25]) ).
fof(f27,plain,
( ? [X0,X1,X2] : addition(domain(X0),multiplication(domain(X1),domain(X2))) != multiplication(addition(domain(X0),domain(X1)),addition(domain(X0),domain(X2)))
=> addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != multiplication(addition(domain(sK0),domain(sK1)),addition(domain(sK0),domain(sK2))) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != multiplication(addition(domain(sK0),domain(sK1)),addition(domain(sK0),domain(sK2))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f26,f27]) ).
fof(f29,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f30,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f20]) ).
fof(f34,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f35,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f36,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f40,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(cnf_transformation,[],[f21]) ).
fof(f41,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[],[f22]) ).
fof(f42,plain,
! [X0] : one = addition(domain(X0),one),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != multiplication(addition(domain(sK0),domain(sK1)),addition(domain(sK0),domain(sK2))),
inference(cnf_transformation,[],[f28]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f29]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f30]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f34]) ).
cnf(c_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f35]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f36]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f37]) ).
cnf(c_60,plain,
addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(cnf_transformation,[],[f40]) ).
cnf(c_61,plain,
domain(multiplication(X0,domain(X1))) = domain(multiplication(X0,X1)),
inference(cnf_transformation,[],[f41]) ).
cnf(c_62,plain,
addition(domain(X0),one) = one,
inference(cnf_transformation,[],[f42]) ).
cnf(c_64,plain,
addition(domain(X0),domain(X1)) = domain(addition(X0,X1)),
inference(cnf_transformation,[],[f44]) ).
cnf(c_65,negated_conjecture,
multiplication(addition(domain(sK0),domain(sK1)),addition(domain(sK0),domain(sK2))) != addition(domain(sK0),multiplication(domain(sK1),domain(sK2))),
inference(cnf_transformation,[],[f45]) ).
cnf(c_79,plain,
addition(one,domain(X0)) = one,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
cnf(c_115,plain,
multiplication(domain(addition(sK0,sK1)),domain(addition(sK0,sK2))) != addition(domain(sK0),multiplication(domain(sK1),domain(sK2))),
inference(ac_demodulation,[status(thm)],[c_65,c_64,c_64,c_50,c_49]) ).
cnf(c_188,plain,
addition(addition(multiplication(domain(sK0),domain(sK0)),multiplication(domain(sK0),domain(sK2))),addition(multiplication(domain(sK1),domain(sK0)),multiplication(domain(sK1),domain(sK2)))) != addition(domain(sK0),multiplication(domain(sK1),domain(sK2))),
inference(demodulation,[status(thm)],[c_115,c_56,c_57,c_64]) ).
cnf(c_189,plain,
addition(multiplication(domain(sK0),domain(sK0)),addition(multiplication(domain(sK1),domain(sK0)),addition(multiplication(domain(sK0),domain(sK2)),multiplication(domain(sK1),domain(sK2))))) != addition(domain(sK0),multiplication(domain(sK1),domain(sK2))),
inference(theory_normalisation,[status(thm)],[c_188,c_50,c_49]) ).
cnf(c_196,plain,
domain(multiplication(one,X0)) = domain(domain(X0)),
inference(superposition,[status(thm)],[c_55,c_61]) ).
cnf(c_202,plain,
domain(domain(X0)) = domain(X0),
inference(light_normalisation,[status(thm)],[c_196,c_55]) ).
cnf(c_364,plain,
addition(multiplication(X0,one),multiplication(X0,domain(X1))) = multiplication(X0,one),
inference(superposition,[status(thm)],[c_79,c_56]) ).
cnf(c_384,plain,
addition(X0,multiplication(X0,domain(X1))) = X0,
inference(light_normalisation,[status(thm)],[c_364,c_54]) ).
cnf(c_401,plain,
addition(multiplication(one,X0),multiplication(domain(X1),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_79,c_57]) ).
cnf(c_420,plain,
addition(X0,multiplication(domain(X1),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_401,c_55]) ).
cnf(c_424,plain,
multiplication(domain(X0),X0) = X0,
inference(demodulation,[status(thm)],[c_60,c_420]) ).
cnf(c_431,plain,
multiplication(domain(X0),domain(X0)) = domain(X0),
inference(superposition,[status(thm)],[c_202,c_424]) ).
cnf(c_442,plain,
addition(domain(sK0),addition(multiplication(domain(sK1),domain(sK0)),addition(multiplication(domain(sK0),domain(sK2)),multiplication(domain(sK1),domain(sK2))))) != addition(domain(sK0),multiplication(domain(sK1),domain(sK2))),
inference(demodulation,[status(thm)],[c_189,c_431]) ).
cnf(c_462,plain,
addition(X0,addition(multiplication(X0,domain(X1)),X2)) = addition(X0,X2),
inference(superposition,[status(thm)],[c_384,c_50]) ).
cnf(c_491,plain,
addition(X0,addition(multiplication(domain(X1),X0),X2)) = addition(X0,X2),
inference(superposition,[status(thm)],[c_420,c_50]) ).
cnf(c_504,plain,
addition(domain(sK0),addition(multiplication(domain(sK0),domain(sK2)),multiplication(domain(sK1),domain(sK2)))) != addition(domain(sK0),multiplication(domain(sK1),domain(sK2))),
inference(demodulation,[status(thm)],[c_442,c_491]) ).
cnf(c_505,plain,
addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != addition(domain(sK0),multiplication(domain(sK1),domain(sK2))),
inference(demodulation,[status(thm)],[c_504,c_462]) ).
cnf(c_506,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_505]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE071+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 29 11:47:54 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.46/1.14 % SZS status Started for theBenchmark.p
% 3.46/1.14 % SZS status Theorem for theBenchmark.p
% 3.46/1.14
% 3.46/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.46/1.14
% 3.46/1.14 ------ iProver source info
% 3.46/1.14
% 3.46/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.46/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.46/1.14 git: non_committed_changes: false
% 3.46/1.14 git: last_make_outside_of_git: false
% 3.46/1.14
% 3.46/1.14 ------ Parsing...
% 3.46/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.46/1.14
% 3.46/1.14 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.46/1.14
% 3.46/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.46/1.14
% 3.46/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.46/1.14 ------ Proving...
% 3.46/1.14 ------ Problem Properties
% 3.46/1.14
% 3.46/1.14
% 3.46/1.14 clauses 17
% 3.46/1.14 conjectures 0
% 3.46/1.14 EPR 0
% 3.46/1.14 Horn 17
% 3.46/1.14 unary 17
% 3.46/1.14 binary 0
% 3.46/1.14 lits 17
% 3.46/1.14 lits eq 17
% 3.46/1.14 fd_pure 0
% 3.46/1.14 fd_pseudo 0
% 3.46/1.14 fd_cond 0
% 3.46/1.14 fd_pseudo_cond 0
% 3.46/1.14 AC symbols 1
% 3.46/1.14
% 3.46/1.14 ------ Schedule UEQ
% 3.46/1.14
% 3.46/1.14 ------ Option_UEQ Time Limit: 10.
% 3.46/1.14
% 3.46/1.14
% 3.46/1.14 ------
% 3.46/1.14 Current options:
% 3.46/1.14 ------
% 3.46/1.14
% 3.46/1.14
% 3.46/1.14
% 3.46/1.14
% 3.46/1.14 ------ Proving...
% 3.46/1.14
% 3.46/1.14
% 3.46/1.14 % SZS status Theorem for theBenchmark.p
% 3.46/1.14
% 3.46/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.46/1.14
% 3.46/1.15
%------------------------------------------------------------------------------