TSTP Solution File: KLE113+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KLE113+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 : Fri May 3 02:32:57 EDT 2024
% Result : Theorem 3.20s 1.16s
% Output : CNFRefutation 3.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 50 ( 49 unt; 0 def)
% Number of atoms : 51 ( 50 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 13 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 1 sgn 39 !; 2 ?)
% 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(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f10,axiom,
! [X0] : zero = multiplication(X0,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_annihilation) ).
fof(f13,axiom,
! [X3] : zero = multiplication(antidomain(X3),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain1) ).
fof(f15,axiom,
! [X3] : one = addition(antidomain(antidomain(X3)),antidomain(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain3) ).
fof(f16,axiom,
! [X3] : antidomain(antidomain(X3)) = domain(X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain4) ).
fof(f23,axiom,
! [X3,X4] : forward_diamond(X3,X4) = domain(multiplication(X3,domain(X4))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',forward_diamond) ).
fof(f27,conjecture,
! [X3] : zero = forward_diamond(X3,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f28,negated_conjecture,
~ ! [X3] : zero = forward_diamond(X3,zero),
inference(negated_conjecture,[],[f27]) ).
fof(f29,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f30,plain,
! [X0] : zero = multiplication(antidomain(X0),X0),
inference(rectify,[],[f13]) ).
fof(f32,plain,
! [X0] : one = addition(antidomain(antidomain(X0)),antidomain(X0)),
inference(rectify,[],[f15]) ).
fof(f33,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(rectify,[],[f16]) ).
fof(f40,plain,
! [X0,X1] : forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1))),
inference(rectify,[],[f23]) ).
fof(f44,plain,
~ ! [X0] : zero = forward_diamond(X0,zero),
inference(rectify,[],[f28]) ).
fof(f45,plain,
? [X0] : zero != forward_diamond(X0,zero),
inference(ennf_transformation,[],[f44]) ).
fof(f46,plain,
( ? [X0] : zero != forward_diamond(X0,zero)
=> zero != forward_diamond(sK0,zero) ),
introduced(choice_axiom,[]) ).
fof(f47,plain,
zero != forward_diamond(sK0,zero),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f45,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,[],[f29]) ).
fof(f50,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f53,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f57,plain,
! [X0] : zero = multiplication(X0,zero),
inference(cnf_transformation,[],[f10]) ).
fof(f59,plain,
! [X0] : zero = multiplication(antidomain(X0),X0),
inference(cnf_transformation,[],[f30]) ).
fof(f61,plain,
! [X0] : one = addition(antidomain(antidomain(X0)),antidomain(X0)),
inference(cnf_transformation,[],[f32]) ).
fof(f62,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(cnf_transformation,[],[f33]) ).
fof(f69,plain,
! [X0,X1] : forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[],[f40]) ).
fof(f73,plain,
zero != forward_diamond(sK0,zero),
inference(cnf_transformation,[],[f47]) ).
fof(f78,plain,
! [X0,X1] : forward_diamond(X0,X1) = antidomain(antidomain(multiplication(X0,antidomain(antidomain(X1))))),
inference(definition_unfolding,[],[f69,f62,f62]) ).
fof(f80,plain,
zero != antidomain(antidomain(multiplication(sK0,antidomain(antidomain(zero))))),
inference(definition_unfolding,[],[f73,f78]) ).
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_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f50]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f53]) ).
cnf(c_58,plain,
multiplication(X0,zero) = zero,
inference(cnf_transformation,[],[f57]) ).
cnf(c_60,plain,
multiplication(antidomain(X0),X0) = zero,
inference(cnf_transformation,[],[f59]) ).
cnf(c_62,plain,
addition(antidomain(antidomain(X0)),antidomain(X0)) = one,
inference(cnf_transformation,[],[f61]) ).
cnf(c_66,negated_conjecture,
antidomain(antidomain(multiplication(sK0,antidomain(antidomain(zero))))) != zero,
inference(cnf_transformation,[],[f80]) ).
cnf(c_82,plain,
addition(antidomain(X0),antidomain(antidomain(X0))) = one,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
cnf(c_317,plain,
antidomain(one) = zero,
inference(superposition,[status(thm)],[c_54,c_60]) ).
cnf(c_321,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_334,plain,
addition(zero,antidomain(zero)) = one,
inference(superposition,[status(thm)],[c_317,c_82]) ).
cnf(c_376,plain,
antidomain(zero) = one,
inference(superposition,[status(thm)],[c_321,c_334]) ).
cnf(c_381,plain,
antidomain(antidomain(multiplication(sK0,antidomain(one)))) != zero,
inference(superposition,[status(thm)],[c_376,c_66]) ).
cnf(c_401,plain,
antidomain(antidomain(multiplication(sK0,zero))) != zero,
inference(superposition,[status(thm)],[c_317,c_381]) ).
cnf(c_402,plain,
antidomain(antidomain(zero)) != zero,
inference(superposition,[status(thm)],[c_58,c_401]) ).
cnf(c_403,plain,
antidomain(one) != zero,
inference(superposition,[status(thm)],[c_376,c_402]) ).
cnf(c_404,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_403,c_317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE113+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 00:30:56 EDT 2024
% 0.12/0.34 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.20/1.16 % SZS status Started for theBenchmark.p
% 3.20/1.16 % SZS status Theorem for theBenchmark.p
% 3.20/1.16
% 3.20/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.20/1.16
% 3.20/1.16 ------ iProver source info
% 3.20/1.16
% 3.20/1.16 git: date: 2024-05-02 19:28:25 +0000
% 3.20/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.20/1.16 git: non_committed_changes: false
% 3.20/1.16
% 3.20/1.16 ------ Parsing...
% 3.20/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.20/1.16
% 3.20/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.20/1.16
% 3.20/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.20/1.16
% 3.20/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.20/1.16 ------ Proving...
% 3.20/1.16 ------ Problem Properties
% 3.20/1.16
% 3.20/1.16
% 3.20/1.16 clauses 18
% 3.20/1.16 conjectures 1
% 3.20/1.16 EPR 0
% 3.20/1.16 Horn 18
% 3.20/1.16 unary 18
% 3.20/1.16 binary 0
% 3.20/1.16 lits 18
% 3.20/1.16 lits eq 18
% 3.20/1.16 fd_pure 0
% 3.20/1.16 fd_pseudo 0
% 3.20/1.16 fd_cond 0
% 3.20/1.16 fd_pseudo_cond 0
% 3.20/1.16 AC symbols 1
% 3.20/1.16
% 3.20/1.16 ------ Input Options Time Limit: Unbounded
% 3.20/1.16
% 3.20/1.16
% 3.20/1.16 ------
% 3.20/1.16 Current options:
% 3.20/1.16 ------
% 3.20/1.16
% 3.20/1.16
% 3.20/1.16
% 3.20/1.16
% 3.20/1.16 ------ Proving...
% 3.20/1.16
% 3.20/1.16
% 3.20/1.16 % SZS status Theorem for theBenchmark.p
% 3.20/1.16
% 3.20/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.20/1.16
% 3.20/1.16
%------------------------------------------------------------------------------