TSTP Solution File: KLE063+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE063+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:57 EDT 2023
% Result : Theorem 2.04s 1.18s
% Output : CNFRefutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 57 ( 51 unt; 0 def)
% Number of atoms : 65 ( 64 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 19 ( 11 ~; 0 |; 4 &)
% ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 87 ( 8 sgn; 50 !; 4 ?)
% 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(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_distributivity) ).
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(f14,axiom,
! [X3,X4] : domain(multiplication(X3,X4)) = domain(multiplication(X3,domain(X4))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain2) ).
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] :
( multiplication(domain(X4),X3) = addition(X3,multiplication(domain(X4),X3))
=> domain(X4) = addition(domain(X3),domain(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X3,X4] :
( multiplication(domain(X4),X3) = addition(X3,multiplication(domain(X4),X3))
=> domain(X4) = addition(domain(X3),domain(X4)) ),
inference(negated_conjecture,[],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f22,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(rectify,[],[f14]) ).
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] :
( multiplication(domain(X1),X0) = addition(X0,multiplication(domain(X1),X0))
=> domain(X1) = addition(domain(X0),domain(X1)) ),
inference(rectify,[],[f19]) ).
fof(f26,plain,
? [X0,X1] :
( domain(X1) != addition(domain(X0),domain(X1))
& multiplication(domain(X1),X0) = addition(X0,multiplication(domain(X1),X0)) ),
inference(ennf_transformation,[],[f25]) ).
fof(f27,plain,
( ? [X0,X1] :
( domain(X1) != addition(domain(X0),domain(X1))
& multiplication(domain(X1),X0) = addition(X0,multiplication(domain(X1),X0)) )
=> ( domain(sK1) != addition(domain(sK0),domain(sK1))
& multiplication(domain(sK1),sK0) = addition(sK0,multiplication(domain(sK1),sK0)) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
( domain(sK1) != addition(domain(sK0),domain(sK1))
& multiplication(domain(sK1),sK0) = addition(sK0,multiplication(domain(sK1),sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[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(f34,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f35,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f36,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f41,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[],[f22]) ).
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,
multiplication(domain(sK1),sK0) = addition(sK0,multiplication(domain(sK1),sK0)),
inference(cnf_transformation,[],[f28]) ).
fof(f46,plain,
domain(sK1) != addition(domain(sK0),domain(sK1)),
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_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f34]) ).
cnf(c_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f35]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f36]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f37]) ).
cnf(c_61,plain,
domain(multiplication(X0,domain(X1))) = domain(multiplication(X0,X1)),
inference(cnf_transformation,[],[f41]) ).
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,
addition(domain(sK0),domain(sK1)) != domain(sK1),
inference(cnf_transformation,[],[f46]) ).
cnf(c_66,negated_conjecture,
addition(sK0,multiplication(domain(sK1),sK0)) = multiplication(domain(sK1),sK0),
inference(cnf_transformation,[],[f45]) ).
cnf(c_80,plain,
addition(one,domain(X0)) = one,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
cnf(c_81,negated_conjecture,
addition(domain(sK1),domain(sK0)) != domain(sK1),
inference(theory_normalisation,[status(thm)],[c_65,c_50,c_49]) ).
cnf(c_119,plain,
domain(addition(sK1,sK0)) != domain(sK1),
inference(ac_demodulation,[status(thm)],[c_81,c_64,c_50,c_49]) ).
cnf(c_195,plain,
addition(domain(sK1),domain(sK0)) != domain(sK1),
inference(demodulation,[status(thm)],[c_119,c_64]) ).
cnf(c_202,plain,
domain(multiplication(one,X0)) = domain(domain(X0)),
inference(superposition,[status(thm)],[c_55,c_61]) ).
cnf(c_208,plain,
domain(domain(X0)) = domain(X0),
inference(light_normalisation,[status(thm)],[c_202,c_55]) ).
cnf(c_363,plain,
addition(multiplication(X0,one),multiplication(X0,domain(X1))) = multiplication(X0,one),
inference(superposition,[status(thm)],[c_80,c_56]) ).
cnf(c_382,plain,
addition(X0,multiplication(X0,domain(X1))) = X0,
inference(light_normalisation,[status(thm)],[c_363,c_54]) ).
cnf(c_398,plain,
addition(multiplication(one,X0),multiplication(domain(X1),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_80,c_57]) ).
cnf(c_416,plain,
addition(X0,multiplication(domain(X1),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_398,c_55]) ).
cnf(c_419,plain,
multiplication(domain(sK1),sK0) = sK0,
inference(demodulation,[status(thm)],[c_66,c_416]) ).
cnf(c_507,plain,
addition(domain(X0),domain(multiplication(X0,domain(X1)))) = domain(X0),
inference(superposition,[status(thm)],[c_382,c_64]) ).
cnf(c_518,plain,
addition(domain(X0),domain(multiplication(X0,X1))) = domain(X0),
inference(light_normalisation,[status(thm)],[c_507,c_61]) ).
cnf(c_753,plain,
addition(domain(domain(sK1)),domain(sK0)) = domain(domain(sK1)),
inference(superposition,[status(thm)],[c_419,c_518]) ).
cnf(c_779,plain,
addition(domain(sK1),domain(sK0)) = domain(sK1),
inference(demodulation,[status(thm)],[c_753,c_208]) ).
cnf(c_780,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_779,c_195]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : KLE063+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 29 11:36:47 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.04/1.18 % SZS status Started for theBenchmark.p
% 2.04/1.18 % SZS status Theorem for theBenchmark.p
% 2.04/1.18
% 2.04/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.04/1.18
% 2.04/1.18 ------ iProver source info
% 2.04/1.18
% 2.04/1.18 git: date: 2023-05-31 18:12:56 +0000
% 2.04/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.04/1.18 git: non_committed_changes: false
% 2.04/1.18 git: last_make_outside_of_git: false
% 2.04/1.18
% 2.04/1.18 ------ Parsing...
% 2.04/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.04/1.18
% 2.04/1.18 ------ Preprocessing... sup_sim: 3 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.04/1.18
% 2.04/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.04/1.18
% 2.04/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.04/1.18 ------ Proving...
% 2.04/1.18 ------ Problem Properties
% 2.04/1.18
% 2.04/1.18
% 2.04/1.18 clauses 18
% 2.04/1.18 conjectures 1
% 2.04/1.18 EPR 0
% 2.04/1.18 Horn 18
% 2.04/1.18 unary 18
% 2.04/1.18 binary 0
% 2.04/1.18 lits 18
% 2.04/1.18 lits eq 18
% 2.04/1.18 fd_pure 0
% 2.04/1.18 fd_pseudo 0
% 2.04/1.18 fd_cond 0
% 2.04/1.18 fd_pseudo_cond 0
% 2.04/1.18 AC symbols 1
% 2.04/1.18
% 2.04/1.18 ------ Schedule UEQ
% 2.04/1.18
% 2.04/1.18 ------ Option_UEQ Time Limit: 10.
% 2.04/1.18
% 2.04/1.18
% 2.04/1.18 ------
% 2.04/1.18 Current options:
% 2.04/1.18 ------
% 2.04/1.18
% 2.04/1.18
% 2.04/1.18
% 2.04/1.18
% 2.04/1.18 ------ Proving...
% 2.04/1.18
% 2.04/1.18
% 2.04/1.18 % SZS status Theorem for theBenchmark.p
% 2.04/1.18
% 2.04/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.04/1.18
% 2.04/1.18
%------------------------------------------------------------------------------