TSTP Solution File: KLE083+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE083+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 3.49s 1.05s
% Output : CNFRefutation 3.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 43 unt; 0 def)
% Number of atoms : 45 ( 44 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 57 ( 0 sgn; 35 !; 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(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',left_distributivity) ).
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(f21,conjecture,
! [X3] : multiplication(domain(X3),X3) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f22,negated_conjecture,
~ ! [X3] : multiplication(domain(X3),X3) = X3,
inference(negated_conjecture,[],[f21]) ).
fof(f23,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f24,plain,
! [X0] : zero = multiplication(antidomain(X0),X0),
inference(rectify,[],[f13]) ).
fof(f26,plain,
! [X0] : one = addition(antidomain(antidomain(X0)),antidomain(X0)),
inference(rectify,[],[f15]) ).
fof(f27,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(rectify,[],[f16]) ).
fof(f32,plain,
~ ! [X0] : multiplication(domain(X0),X0) = X0,
inference(rectify,[],[f22]) ).
fof(f33,plain,
? [X0] : multiplication(domain(X0),X0) != X0,
inference(ennf_transformation,[],[f32]) ).
fof(f34,plain,
( ? [X0] : multiplication(domain(X0),X0) != X0
=> sK0 != multiplication(domain(sK0),sK0) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
sK0 != multiplication(domain(sK0),sK0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f33,f34]) ).
fof(f36,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f37,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f23]) ).
fof(f38,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f42,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f44,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f47,plain,
! [X0] : zero = multiplication(antidomain(X0),X0),
inference(cnf_transformation,[],[f24]) ).
fof(f49,plain,
! [X0] : one = addition(antidomain(antidomain(X0)),antidomain(X0)),
inference(cnf_transformation,[],[f26]) ).
fof(f50,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(cnf_transformation,[],[f27]) ).
fof(f55,plain,
sK0 != multiplication(domain(sK0),sK0),
inference(cnf_transformation,[],[f35]) ).
fof(f56,plain,
sK0 != multiplication(antidomain(antidomain(sK0)),sK0),
inference(definition_unfolding,[],[f55,f50]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f36]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f37]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f38]) ).
cnf(c_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f42]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f44]) ).
cnf(c_60,plain,
multiplication(antidomain(X0),X0) = zero,
inference(cnf_transformation,[],[f47]) ).
cnf(c_62,plain,
addition(antidomain(antidomain(X0)),antidomain(X0)) = one,
inference(cnf_transformation,[],[f49]) ).
cnf(c_66,negated_conjecture,
multiplication(antidomain(antidomain(sK0)),sK0) != sK0,
inference(cnf_transformation,[],[f56]) ).
cnf(c_82,plain,
addition(antidomain(X0),antidomain(antidomain(X0))) = one,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
cnf(c_207,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_365,plain,
addition(multiplication(antidomain(X0),X1),multiplication(antidomain(antidomain(X0)),X1)) = multiplication(one,X1),
inference(superposition,[status(thm)],[c_82,c_57]) ).
cnf(c_6270,plain,
addition(multiplication(antidomain(X0),X1),multiplication(antidomain(antidomain(X0)),X1)) = X1,
inference(demodulation,[status(thm)],[c_365,c_55]) ).
cnf(c_6274,plain,
addition(zero,multiplication(antidomain(antidomain(X0)),X0)) = X0,
inference(superposition,[status(thm)],[c_60,c_6270]) ).
cnf(c_6394,plain,
multiplication(antidomain(antidomain(X0)),X0) = X0,
inference(demodulation,[status(thm)],[c_6274,c_207]) ).
cnf(c_6395,plain,
sK0 != sK0,
inference(demodulation,[status(thm)],[c_66,c_6394]) ).
cnf(c_6396,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_6395]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : KLE083+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n032.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:29:46 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.39 Running first-order theorem proving
% 0.15/0.39 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.49/1.05 % SZS status Started for theBenchmark.p
% 3.49/1.05 % SZS status Theorem for theBenchmark.p
% 3.49/1.05
% 3.49/1.05 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.49/1.05
% 3.49/1.05 ------ iProver source info
% 3.49/1.05
% 3.49/1.05 git: date: 2023-05-31 18:12:56 +0000
% 3.49/1.05 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.49/1.05 git: non_committed_changes: false
% 3.49/1.05 git: last_make_outside_of_git: false
% 3.49/1.05
% 3.49/1.05 ------ Parsing...
% 3.49/1.05 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.49/1.05
% 3.49/1.05 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.49/1.05
% 3.49/1.05 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.49/1.05
% 3.49/1.05 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.49/1.05 ------ Proving...
% 3.49/1.05 ------ Problem Properties
% 3.49/1.05
% 3.49/1.05
% 3.49/1.05 clauses 18
% 3.49/1.05 conjectures 1
% 3.49/1.05 EPR 0
% 3.49/1.05 Horn 18
% 3.49/1.05 unary 18
% 3.49/1.05 binary 0
% 3.49/1.05 lits 18
% 3.49/1.05 lits eq 18
% 3.49/1.05 fd_pure 0
% 3.49/1.05 fd_pseudo 0
% 3.49/1.05 fd_cond 0
% 3.49/1.05 fd_pseudo_cond 0
% 3.49/1.05 AC symbols 1
% 3.49/1.05
% 3.49/1.05 ------ Schedule UEQ
% 3.49/1.05
% 3.49/1.05 ------ Option_UEQ Time Limit: 10.
% 3.49/1.05
% 3.49/1.05
% 3.49/1.05 ------
% 3.49/1.05 Current options:
% 3.49/1.05 ------
% 3.49/1.05
% 3.49/1.05
% 3.49/1.05
% 3.49/1.05
% 3.49/1.05 ------ Proving...
% 3.49/1.05
% 3.49/1.05
% 3.49/1.05 % SZS status Theorem for theBenchmark.p
% 3.49/1.05
% 3.49/1.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.49/1.05
% 3.49/1.05
%------------------------------------------------------------------------------