TSTP Solution File: KLE037+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE037+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:51 EDT 2023
% Result : Theorem 3.68s 1.17s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 26 unt; 0 def)
% Number of atoms : 42 ( 20 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 23 ( 14 ~; 6 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 2 sgn; 28 !; 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(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_idempotence) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f14,axiom,
! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_unfold_left) ).
fof(f17,conjecture,
! [X3] : leq(one,star(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X3] : leq(one,star(X3)),
inference(negated_conjecture,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f20,plain,
~ ! [X0] : leq(one,star(X0)),
inference(rectify,[],[f18]) ).
fof(f23,plain,
? [X0] : ~ leq(one,star(X0)),
inference(ennf_transformation,[],[f20]) ).
fof(f24,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f25,plain,
( ? [X0] : ~ leq(one,star(X0))
=> ~ leq(one,star(sK0)) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
~ leq(one,star(sK0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f25]) ).
fof(f27,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f28,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f38,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f39,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f41,plain,
! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(cnf_transformation,[],[f14]) ).
fof(f44,plain,
~ leq(one,star(sK0)),
inference(cnf_transformation,[],[f26]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f27]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f28]) ).
cnf(c_52,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f30]) ).
cnf(c_60,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_61,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_63,plain,
leq(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(cnf_transformation,[],[f41]) ).
cnf(c_66,negated_conjecture,
~ leq(one,star(sK0)),
inference(cnf_transformation,[],[f44]) ).
cnf(c_460,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_494,plain,
addition(addition(one,multiplication(star(X0),X0)),star(X0)) = star(X0),
inference(superposition,[status(thm)],[c_63,c_61]) ).
cnf(c_495,plain,
addition(one,addition(star(X0),multiplication(star(X0),X0))) = star(X0),
inference(theory_normalisation,[status(thm)],[c_494,c_50,c_49]) ).
cnf(c_525,plain,
leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_460,c_60]) ).
cnf(c_4920,plain,
leq(one,star(X0)),
inference(superposition,[status(thm)],[c_495,c_525]) ).
cnf(c_5074,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_66,c_4920]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KLE037+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 11:16:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.68/1.17 % SZS status Started for theBenchmark.p
% 3.68/1.17 % SZS status Theorem for theBenchmark.p
% 3.68/1.17
% 3.68/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.68/1.17
% 3.68/1.17 ------ iProver source info
% 3.68/1.17
% 3.68/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.68/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.68/1.17 git: non_committed_changes: false
% 3.68/1.17 git: last_make_outside_of_git: false
% 3.68/1.17
% 3.68/1.17 ------ Parsing...
% 3.68/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.68/1.17
% 3.68/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.68/1.17
% 3.68/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.68/1.17
% 3.68/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.68/1.17 ------ Proving...
% 3.68/1.17 ------ Problem Properties
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17 clauses 18
% 3.68/1.17 conjectures 1
% 3.68/1.17 EPR 0
% 3.68/1.17 Horn 18
% 3.68/1.17 unary 14
% 3.68/1.17 binary 4
% 3.68/1.17 lits 22
% 3.68/1.17 lits eq 13
% 3.68/1.17 fd_pure 0
% 3.68/1.17 fd_pseudo 0
% 3.68/1.17 fd_cond 0
% 3.68/1.17 fd_pseudo_cond 0
% 3.68/1.17 AC symbols 1
% 3.68/1.17
% 3.68/1.17 ------ Schedule dynamic 5 is on
% 3.68/1.17
% 3.68/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17 ------
% 3.68/1.17 Current options:
% 3.68/1.17 ------
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17 ------ Proving...
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17 % SZS status Theorem for theBenchmark.p
% 3.68/1.17
% 3.68/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/1.18
% 3.68/1.18
%------------------------------------------------------------------------------