TSTP Solution File: KLE052+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE052+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:55 EDT 2023
% Result : Theorem 3.68s 1.16s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 33 unt; 0 def)
% Number of atoms : 35 ( 34 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 4 sgn; 30 !; 2 ?)
% 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(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',left_distributivity) ).
fof(f13,axiom,
! [X3] : multiplication(domain(X3),X3) = addition(X3,multiplication(domain(X3),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain1) ).
fof(f15,axiom,
! [X3] : one = addition(domain(X3),one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain3) ).
fof(f18,conjecture,
! [X3] : multiplication(domain(X3),X3) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X3] : multiplication(domain(X3),X3) = X3,
inference(negated_conjecture,[],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f21,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(rectify,[],[f13]) ).
fof(f23,plain,
! [X0] : one = addition(domain(X0),one),
inference(rectify,[],[f15]) ).
fof(f25,plain,
~ ! [X0] : multiplication(domain(X0),X0) = X0,
inference(rectify,[],[f19]) ).
fof(f26,plain,
? [X0] : multiplication(domain(X0),X0) != X0,
inference(ennf_transformation,[],[f25]) ).
fof(f27,plain,
( ? [X0] : multiplication(domain(X0),X0) != X0
=> sK0 != multiplication(domain(sK0),sK0) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
sK0 != multiplication(domain(sK0),sK0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[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(f35,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f40,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(cnf_transformation,[],[f21]) ).
fof(f42,plain,
! [X0] : one = addition(domain(X0),one),
inference(cnf_transformation,[],[f23]) ).
fof(f45,plain,
sK0 != multiplication(domain(sK0),sK0),
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_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f35]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f37]) ).
cnf(c_60,plain,
addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(cnf_transformation,[],[f40]) ).
cnf(c_62,plain,
addition(domain(X0),one) = one,
inference(cnf_transformation,[],[f42]) ).
cnf(c_65,negated_conjecture,
multiplication(domain(sK0),sK0) != sK0,
inference(cnf_transformation,[],[f45]) ).
cnf(c_79,plain,
addition(one,domain(X0)) = one,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
cnf(c_382,plain,
addition(multiplication(one,X0),multiplication(domain(X1),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_79,c_57]) ).
cnf(c_402,plain,
addition(X0,multiplication(domain(X1),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_382,c_55]) ).
cnf(c_406,plain,
multiplication(domain(X0),X0) = X0,
inference(demodulation,[status(thm)],[c_60,c_402]) ).
cnf(c_407,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_65,c_406]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE052+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 12:21:11 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.68/1.16 % SZS status Started for theBenchmark.p
% 3.68/1.16 % SZS status Theorem for theBenchmark.p
% 3.68/1.16
% 3.68/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.68/1.16
% 3.68/1.16 ------ iProver source info
% 3.68/1.16
% 3.68/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.68/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.68/1.16 git: non_committed_changes: false
% 3.68/1.16 git: last_make_outside_of_git: false
% 3.68/1.16
% 3.68/1.16 ------ Parsing...
% 3.68/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.68/1.16
% 3.68/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.68/1.16
% 3.68/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.68/1.16
% 3.68/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.68/1.16 ------ Proving...
% 3.68/1.16 ------ Problem Properties
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16 clauses 17
% 3.68/1.16 conjectures 1
% 3.68/1.16 EPR 0
% 3.68/1.16 Horn 17
% 3.68/1.16 unary 17
% 3.68/1.16 binary 0
% 3.68/1.16 lits 17
% 3.68/1.16 lits eq 17
% 3.68/1.16 fd_pure 0
% 3.68/1.16 fd_pseudo 0
% 3.68/1.16 fd_cond 0
% 3.68/1.16 fd_pseudo_cond 0
% 3.68/1.16 AC symbols 1
% 3.68/1.16
% 3.68/1.16 ------ Schedule UEQ
% 3.68/1.16
% 3.68/1.16 ------ Option_UEQ Time Limit: 10.
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16 ------
% 3.68/1.16 Current options:
% 3.68/1.16 ------
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16 ------ Proving...
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16 % SZS status Theorem for theBenchmark.p
% 3.68/1.16
% 3.68/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/1.16
% 3.68/1.16
%------------------------------------------------------------------------------