TSTP Solution File: KLE056+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KLE056+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:47 EDT 2024
% Result : Theorem 2.74s 1.14s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
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(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f10,axiom,
! [X0] : zero = multiplication(X0,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_annihilation) ).
fof(f11,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).
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(f16,axiom,
zero = domain(zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain4) ).
fof(f18,conjecture,
! [X3] :
( zero = domain(X3)
=> zero = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X3] :
( zero = domain(X3)
=> zero = X3 ),
inference(negated_conjecture,[],[f18]) ).
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(f25,plain,
~ ! [X0] :
( zero = domain(X0)
=> zero = X0 ),
inference(rectify,[],[f19]) ).
fof(f26,plain,
? [X0] :
( zero != X0
& zero = domain(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f27,plain,
( ? [X0] :
( zero != X0
& zero = domain(X0) )
=> ( zero != sK0
& zero = domain(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
( zero != sK0
& zero = domain(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f26,f27]) ).
fof(f31,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
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(f38,plain,
! [X0] : zero = multiplication(X0,zero),
inference(cnf_transformation,[],[f10]) ).
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(f41,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[],[f22]) ).
fof(f43,plain,
zero = domain(zero),
inference(cnf_transformation,[],[f16]) ).
fof(f45,plain,
zero = domain(sK0),
inference(cnf_transformation,[],[f28]) ).
fof(f46,plain,
zero != sK0,
inference(cnf_transformation,[],[f28]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f31]) ).
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_58,plain,
multiplication(X0,zero) = zero,
inference(cnf_transformation,[],[f38]) ).
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_61,plain,
domain(multiplication(X0,domain(X1))) = domain(multiplication(X0,X1)),
inference(cnf_transformation,[],[f41]) ).
cnf(c_63,plain,
domain(zero) = zero,
inference(cnf_transformation,[],[f43]) ).
cnf(c_65,negated_conjecture,
zero != sK0,
inference(cnf_transformation,[],[f46]) ).
cnf(c_66,negated_conjecture,
domain(sK0) = zero,
inference(cnf_transformation,[],[f45]) ).
cnf(c_123,plain,
domain(sK0) = sP0_iProver_def,
definition ).
cnf(c_124,negated_conjecture,
sP0_iProver_def = zero,
inference(demodulation,[status(thm)],[c_66,c_123]) ).
cnf(c_125,negated_conjecture,
zero != sK0,
inference(demodulation,[status(thm)],[c_65]) ).
cnf(c_197,plain,
sK0 != sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_125,c_124]) ).
cnf(c_198,plain,
domain(sP0_iProver_def) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_63,c_124]) ).
cnf(c_199,plain,
addition(X0,sP0_iProver_def) = X0,
inference(light_normalisation,[status(thm)],[c_51,c_124]) ).
cnf(c_203,plain,
multiplication(X0,sP0_iProver_def) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_58,c_124]) ).
cnf(c_204,plain,
multiplication(sP0_iProver_def,X0) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_59,c_124]) ).
cnf(c_212,plain,
domain(multiplication(X0,sK0)) = domain(multiplication(X0,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_123,c_61]) ).
cnf(c_217,plain,
domain(multiplication(X0,sK0)) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_212,c_198,c_203]) ).
cnf(c_373,plain,
multiplication(sP0_iProver_def,multiplication(X0,X1)) = multiplication(sP0_iProver_def,X1),
inference(superposition,[status(thm)],[c_204,c_53]) ).
cnf(c_410,plain,
addition(multiplication(X0,sK0),multiplication(sP0_iProver_def,multiplication(X0,sK0))) = multiplication(sP0_iProver_def,multiplication(X0,sK0)),
inference(superposition,[status(thm)],[c_217,c_60]) ).
cnf(c_470,plain,
multiplication(X0,sK0) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_410,c_199,c_204,c_373]) ).
cnf(c_483,plain,
sK0 = sP0_iProver_def,
inference(superposition,[status(thm)],[c_470,c_55]) ).
cnf(c_485,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_483,c_197]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KLE056+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 00:30:17 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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
% 2.74/1.14 % SZS status Started for theBenchmark.p
% 2.74/1.14 % SZS status Theorem for theBenchmark.p
% 2.74/1.14
% 2.74/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.74/1.14
% 2.74/1.14 ------ iProver source info
% 2.74/1.14
% 2.74/1.14 git: date: 2024-05-02 19:28:25 +0000
% 2.74/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.74/1.14 git: non_committed_changes: false
% 2.74/1.14
% 2.74/1.14 ------ Parsing...
% 2.74/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.74/1.14
% 2.74/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.74/1.14
% 2.74/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.74/1.14
% 2.74/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.74/1.14 ------ Proving...
% 2.74/1.14 ------ Problem Properties
% 2.74/1.14
% 2.74/1.14
% 2.74/1.14 clauses 19
% 2.74/1.14 conjectures 2
% 2.74/1.14 EPR 2
% 2.74/1.14 Horn 19
% 2.74/1.14 unary 19
% 2.74/1.14 binary 0
% 2.74/1.14 lits 19
% 2.74/1.14 lits eq 19
% 2.74/1.14 fd_pure 0
% 2.74/1.14 fd_pseudo 0
% 2.74/1.14 fd_cond 0
% 2.74/1.14 fd_pseudo_cond 0
% 2.74/1.14 AC symbols 1
% 2.74/1.14
% 2.74/1.14 ------ Schedule UEQ
% 2.74/1.14
% 2.74/1.14 ------ Option_UEQ Time Limit: 10.
% 2.74/1.14
% 2.74/1.14
% 2.74/1.14 ------
% 2.74/1.14 Current options:
% 2.74/1.14 ------
% 2.74/1.14
% 2.74/1.14
% 2.74/1.14
% 2.74/1.14
% 2.74/1.14 ------ Proving...
% 2.74/1.14
% 2.74/1.14
% 2.74/1.14 % SZS status Theorem for theBenchmark.p
% 2.74/1.14
% 2.74/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.74/1.14
% 2.74/1.14
%------------------------------------------------------------------------------