TSTP Solution File: KLE066+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE066+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:58 EDT 2023
% Result : Theorem 2.61s 1.09s
% Output : CNFRefutation 2.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 30 unt; 0 def)
% Number of atoms : 44 ( 43 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 0 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 2 sgn; 25 !; 4 ?)
% 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(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,X4] :
( zero = multiplication(X3,domain(X4))
=> zero = multiplication(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X3,X4] :
( zero = multiplication(X3,domain(X4))
=> zero = multiplication(X3,X4) ),
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,X1] :
( zero = multiplication(X0,domain(X1))
=> zero = multiplication(X0,X1) ),
inference(rectify,[],[f19]) ).
fof(f26,plain,
? [X0,X1] :
( zero != multiplication(X0,X1)
& zero = multiplication(X0,domain(X1)) ),
inference(ennf_transformation,[],[f25]) ).
fof(f27,plain,
( ? [X0,X1] :
( zero != multiplication(X0,X1)
& zero = multiplication(X0,domain(X1)) )
=> ( zero != multiplication(sK0,sK1)
& zero = multiplication(sK0,domain(sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
( zero != multiplication(sK0,sK1)
& zero = multiplication(sK0,domain(sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[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(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 = multiplication(sK0,domain(sK1)),
inference(cnf_transformation,[],[f28]) ).
fof(f46,plain,
zero != multiplication(sK0,sK1),
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_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,
multiplication(sK0,sK1) != zero,
inference(cnf_transformation,[],[f46]) ).
cnf(c_66,negated_conjecture,
multiplication(sK0,domain(sK1)) = zero,
inference(cnf_transformation,[],[f45]) ).
cnf(c_200,plain,
domain(multiplication(sK0,sK1)) = domain(zero),
inference(superposition,[status(thm)],[c_66,c_61]) ).
cnf(c_204,plain,
domain(multiplication(sK0,sK1)) = zero,
inference(light_normalisation,[status(thm)],[c_200,c_63]) ).
cnf(c_346,plain,
multiplication(zero,multiplication(X0,X1)) = multiplication(zero,X1),
inference(superposition,[status(thm)],[c_59,c_53]) ).
cnf(c_377,plain,
addition(multiplication(sK0,sK1),multiplication(zero,multiplication(sK0,sK1))) = multiplication(zero,multiplication(sK0,sK1)),
inference(superposition,[status(thm)],[c_204,c_60]) ).
cnf(c_449,plain,
multiplication(sK0,sK1) = zero,
inference(demodulation,[status(thm)],[c_377,c_51,c_59,c_346]) ).
cnf(c_450,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_449,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : KLE066+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n006.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 : Tue Aug 29 12:19:51 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.61/1.09 % SZS status Started for theBenchmark.p
% 2.61/1.09 % SZS status Theorem for theBenchmark.p
% 2.61/1.09
% 2.61/1.09 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.61/1.09
% 2.61/1.09 ------ iProver source info
% 2.61/1.09
% 2.61/1.09 git: date: 2023-05-31 18:12:56 +0000
% 2.61/1.09 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.61/1.09 git: non_committed_changes: false
% 2.61/1.09 git: last_make_outside_of_git: false
% 2.61/1.09
% 2.61/1.09 ------ Parsing...
% 2.61/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.61/1.09
% 2.61/1.09 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.61/1.09
% 2.61/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.61/1.09
% 2.61/1.09 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.61/1.09 ------ Proving...
% 2.61/1.09 ------ Problem Properties
% 2.61/1.09
% 2.61/1.09
% 2.61/1.09 clauses 18
% 2.61/1.09 conjectures 2
% 2.61/1.09 EPR 0
% 2.61/1.09 Horn 18
% 2.61/1.09 unary 18
% 2.61/1.09 binary 0
% 2.61/1.09 lits 18
% 2.61/1.09 lits eq 18
% 2.61/1.09 fd_pure 0
% 2.61/1.09 fd_pseudo 0
% 2.61/1.09 fd_cond 0
% 2.61/1.09 fd_pseudo_cond 0
% 2.61/1.09 AC symbols 1
% 2.61/1.09
% 2.61/1.09 ------ Schedule UEQ
% 2.61/1.09
% 2.61/1.09 ------ Option_UEQ Time Limit: 10.
% 2.61/1.09
% 2.61/1.09
% 2.61/1.09 ------
% 2.61/1.09 Current options:
% 2.61/1.09 ------
% 2.61/1.09
% 2.61/1.09
% 2.61/1.09
% 2.61/1.09
% 2.61/1.09 ------ Proving...
% 2.61/1.09
% 2.61/1.09
% 2.61/1.09 % SZS status Theorem for theBenchmark.p
% 2.61/1.09
% 2.61/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.61/1.09
% 2.61/1.09
%------------------------------------------------------------------------------