TSTP Solution File: KLE081+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE081+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:02 EDT 2023
% Result : Theorem 10.28s 2.16s
% Output : CNFRefutation 10.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 68 ( 62 unt; 0 def)
% Number of atoms : 83 ( 82 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 23 ( 8 ~; 0 |; 11 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 116 ( 15 sgn; 57 !; 2 ?)
% 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(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_left_identity) ).
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(f11,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_annihilation) ).
fof(f13,axiom,
! [X3] : multiplication(domain(X3),X3) = addition(X3,multiplication(domain(X3),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain1) ).
fof(f15,axiom,
! [X3] : one = addition(domain(X3),one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain3) ).
fof(f17,axiom,
! [X3,X4] : domain(addition(X3,X4)) = addition(domain(X3),domain(X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain5) ).
fof(f18,conjecture,
! [X3] :
( ! [X4] :
( zero = multiplication(domain(X4),antidomain(X4))
& one = addition(domain(X4),antidomain(X4)) )
=> zero = multiplication(antidomain(X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X3] :
( ! [X4] :
( zero = multiplication(domain(X4),antidomain(X4))
& one = addition(domain(X4),antidomain(X4)) )
=> zero = multiplication(antidomain(X3),X3) ),
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(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] :
( zero = multiplication(domain(X1),antidomain(X1))
& one = addition(domain(X1),antidomain(X1)) )
=> zero = multiplication(antidomain(X0),X0) ),
inference(rectify,[],[f19]) ).
fof(f26,plain,
? [X0] :
( zero != multiplication(antidomain(X0),X0)
& ! [X1] :
( zero = multiplication(domain(X1),antidomain(X1))
& one = addition(domain(X1),antidomain(X1)) ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f27,plain,
( ? [X0] :
( zero != multiplication(antidomain(X0),X0)
& ! [X1] :
( zero = multiplication(domain(X1),antidomain(X1))
& one = addition(domain(X1),antidomain(X1)) ) )
=> ( zero != multiplication(antidomain(sK0),sK0)
& ! [X1] :
( zero = multiplication(domain(X1),antidomain(X1))
& one = addition(domain(X1),antidomain(X1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
( zero != multiplication(antidomain(sK0),sK0)
& ! [X1] :
( zero = multiplication(domain(X1),antidomain(X1))
& one = addition(domain(X1),antidomain(X1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[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(f31,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f32,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f33,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f35,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f39,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f40,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(cnf_transformation,[],[f21]) ).
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,
! [X1] : one = addition(domain(X1),antidomain(X1)),
inference(cnf_transformation,[],[f28]) ).
fof(f46,plain,
! [X1] : zero = multiplication(domain(X1),antidomain(X1)),
inference(cnf_transformation,[],[f28]) ).
fof(f47,plain,
zero != multiplication(antidomain(sK0),sK0),
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_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f31]) ).
cnf(c_52,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f32]) ).
cnf(c_53,plain,
multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f33]) ).
cnf(c_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f35]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f37]) ).
cnf(c_59,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f39]) ).
cnf(c_60,plain,
addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(cnf_transformation,[],[f40]) ).
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(antidomain(sK0),sK0) != zero,
inference(cnf_transformation,[],[f47]) ).
cnf(c_66,negated_conjecture,
multiplication(domain(X0),antidomain(X0)) = zero,
inference(cnf_transformation,[],[f46]) ).
cnf(c_67,negated_conjecture,
addition(domain(X0),antidomain(X0)) = one,
inference(cnf_transformation,[],[f45]) ).
cnf(c_83,plain,
addition(one,domain(X0)) = one,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
cnf(c_210,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_351,plain,
multiplication(addition(domain(X0),domain(X1)),antidomain(addition(X0,X1))) = zero,
inference(superposition,[status(thm)],[c_64,c_66]) ).
cnf(c_368,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_564,plain,
addition(multiplication(domain(X0),antidomain(addition(X0,X1))),multiplication(domain(X1),antidomain(addition(X0,X1)))) = zero,
inference(demodulation,[status(thm)],[c_351,c_57]) ).
cnf(c_742,plain,
addition(multiplication(domain(X0),X1),multiplication(antidomain(X0),X1)) = multiplication(one,X1),
inference(superposition,[status(thm)],[c_67,c_57]) ).
cnf(c_743,plain,
addition(multiplication(one,X0),multiplication(domain(X1),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_83,c_57]) ).
cnf(c_770,plain,
addition(X0,multiplication(domain(X1),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_743,c_55]) ).
cnf(c_772,plain,
multiplication(domain(X0),X0) = X0,
inference(demodulation,[status(thm)],[c_60,c_770]) ).
cnf(c_857,plain,
addition(multiplication(domain(X0),X1),multiplication(antidomain(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_742,c_55]) ).
cnf(c_1808,plain,
addition(multiplication(domain(X0),antidomain(addition(X0,X1))),zero) = zero,
inference(superposition,[status(thm)],[c_564,c_368]) ).
cnf(c_1852,plain,
addition(zero,multiplication(domain(X0),antidomain(addition(X0,X1)))) = zero,
inference(theory_normalisation,[status(thm)],[c_1808,c_50,c_49]) ).
cnf(c_15468,plain,
multiplication(domain(X0),antidomain(addition(X0,X1))) = zero,
inference(demodulation,[status(thm)],[c_1852,c_210]) ).
cnf(c_15607,plain,
multiplication(domain(X0),multiplication(antidomain(addition(X0,X1)),X2)) = multiplication(zero,X2),
inference(superposition,[status(thm)],[c_15468,c_53]) ).
cnf(c_39533,plain,
multiplication(domain(X0),multiplication(antidomain(addition(X0,X1)),X2)) = zero,
inference(demodulation,[status(thm)],[c_15607,c_59]) ).
cnf(c_39574,plain,
multiplication(domain(X0),multiplication(antidomain(addition(X1,X0)),X2)) = zero,
inference(superposition,[status(thm)],[c_49,c_39533]) ).
cnf(c_40111,plain,
multiplication(domain(multiplication(antidomain(X0),X1)),multiplication(antidomain(X1),X2)) = zero,
inference(superposition,[status(thm)],[c_857,c_39574]) ).
cnf(c_41555,plain,
multiplication(antidomain(X0),X0) = zero,
inference(superposition,[status(thm)],[c_40111,c_772]) ).
cnf(c_41800,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_65,c_41555]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE081+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n007.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:24:44 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 10.28/2.16 % SZS status Started for theBenchmark.p
% 10.28/2.16 % SZS status Theorem for theBenchmark.p
% 10.28/2.16
% 10.28/2.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 10.28/2.16
% 10.28/2.16 ------ iProver source info
% 10.28/2.16
% 10.28/2.16 git: date: 2023-05-31 18:12:56 +0000
% 10.28/2.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 10.28/2.16 git: non_committed_changes: false
% 10.28/2.16 git: last_make_outside_of_git: false
% 10.28/2.16
% 10.28/2.16 ------ Parsing...
% 10.28/2.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.28/2.16
% 10.28/2.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 10.28/2.16
% 10.28/2.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.28/2.16
% 10.28/2.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 10.28/2.16 ------ Proving...
% 10.28/2.16 ------ Problem Properties
% 10.28/2.16
% 10.28/2.16
% 10.28/2.16 clauses 19
% 10.28/2.16 conjectures 3
% 10.28/2.16 EPR 0
% 10.28/2.16 Horn 19
% 10.28/2.16 unary 19
% 10.28/2.16 binary 0
% 10.28/2.16 lits 19
% 10.28/2.16 lits eq 19
% 10.28/2.16 fd_pure 0
% 10.28/2.16 fd_pseudo 0
% 10.28/2.16 fd_cond 0
% 10.28/2.16 fd_pseudo_cond 0
% 10.28/2.16 AC symbols 1
% 10.28/2.16
% 10.28/2.16 ------ Schedule UEQ
% 10.28/2.16
% 10.28/2.16 ------ Option_UEQ Time Limit: 10.
% 10.28/2.16
% 10.28/2.16
% 10.28/2.16 ------
% 10.28/2.16 Current options:
% 10.28/2.16 ------
% 10.28/2.16
% 10.28/2.16
% 10.28/2.16
% 10.28/2.16
% 10.28/2.16 ------ Proving...
% 10.28/2.16
% 10.28/2.16
% 10.28/2.16 % SZS status Theorem for theBenchmark.p
% 10.28/2.16
% 10.28/2.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.28/2.16
% 10.28/2.17
%------------------------------------------------------------------------------