TSTP Solution File: KLE138+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE138+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:32:14 EDT 2023
% Result : Theorem 2.14s 1.18s
% Output : CNFRefutation 2.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 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 : 29 ( 1 sgn; 19 !; 0 ?)
% 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(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity) ).
fof(f10,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infty_unfold1) ).
fof(f19,conjecture,
one = strong_iteration(zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
one != strong_iteration(zero),
inference(negated_conjecture,[],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f22,plain,
one != strong_iteration(zero),
inference(flattening,[],[f20]) ).
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,[],[f21]) ).
fof(f29,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f36,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f41,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f46,plain,
one != strong_iteration(zero),
inference(cnf_transformation,[],[f22]) ).
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_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f29]) ).
cnf(c_58,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f36]) ).
cnf(c_63,plain,
addition(multiplication(X0,strong_iteration(X0)),one) = strong_iteration(X0),
inference(cnf_transformation,[],[f41]) ).
cnf(c_68,negated_conjecture,
strong_iteration(zero) != one,
inference(cnf_transformation,[],[f46]) ).
cnf(c_86,plain,
addition(one,multiplication(X0,strong_iteration(X0))) = strong_iteration(X0),
inference(theory_normalisation,[status(thm)],[c_63,c_50,c_49]) ).
cnf(c_501,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_511,plain,
addition(one,zero) = strong_iteration(zero),
inference(superposition,[status(thm)],[c_58,c_86]) ).
cnf(c_512,plain,
addition(zero,one) = strong_iteration(zero),
inference(theory_normalisation,[status(thm)],[c_511,c_50,c_49]) ).
cnf(c_513,plain,
addition(zero,one) != one,
inference(demodulation,[status(thm)],[c_68,c_512]) ).
cnf(c_514,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_513,c_501]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE138+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 29 11:51:37 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.14/1.18 % SZS status Started for theBenchmark.p
% 2.14/1.18 % SZS status Theorem for theBenchmark.p
% 2.14/1.18
% 2.14/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.14/1.18
% 2.14/1.18 ------ iProver source info
% 2.14/1.18
% 2.14/1.18 git: date: 2023-05-31 18:12:56 +0000
% 2.14/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.14/1.18 git: non_committed_changes: false
% 2.14/1.18 git: last_make_outside_of_git: false
% 2.14/1.18
% 2.14/1.18 ------ Parsing...
% 2.14/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.14/1.18
% 2.14/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.14/1.18
% 2.14/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.14/1.18
% 2.14/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.14/1.18 ------ Proving...
% 2.14/1.18 ------ Problem Properties
% 2.14/1.18
% 2.14/1.18
% 2.14/1.18 clauses 20
% 2.14/1.18 conjectures 1
% 2.14/1.18 EPR 0
% 2.14/1.18 Horn 20
% 2.14/1.18 unary 15
% 2.14/1.18 binary 5
% 2.14/1.18 lits 25
% 2.14/1.18 lits eq 17
% 2.14/1.18 fd_pure 0
% 2.14/1.18 fd_pseudo 0
% 2.14/1.18 fd_cond 0
% 2.14/1.18 fd_pseudo_cond 0
% 2.14/1.18 AC symbols 1
% 2.14/1.18
% 2.14/1.18 ------ Schedule dynamic 5 is on
% 2.14/1.18
% 2.14/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.14/1.18
% 2.14/1.18
% 2.14/1.18 ------
% 2.14/1.18 Current options:
% 2.14/1.18 ------
% 2.14/1.18
% 2.14/1.18
% 2.14/1.18
% 2.14/1.18
% 2.14/1.18 ------ Proving...
% 2.14/1.18
% 2.14/1.18
% 2.14/1.18 % SZS status Theorem for theBenchmark.p
% 2.14/1.18
% 2.14/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.14/1.18
% 2.14/1.18
%------------------------------------------------------------------------------