TSTP Solution File: KLE005+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE005+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:35 EDT 2023
% Result : Theorem 2.34s 1.07s
% Output : CNFRefutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 20 unt; 0 def)
% Number of atoms : 93 ( 60 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 86 ( 34 ~; 32 |; 11 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 2 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity) ).
fof(f10,axiom,
! [X0] : zero = multiplication(X0,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_annihilation) ).
fof(f11,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).
fof(f14,axiom,
! [X3,X4] :
( complement(X4,X3)
<=> ( one = addition(X3,X4)
& zero = multiplication(X4,X3)
& zero = multiplication(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_2) ).
fof(f15,axiom,
! [X3,X4] :
( test(X3)
=> ( c(X3) = X4
<=> complement(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_3) ).
fof(f16,axiom,
! [X3] :
( ~ test(X3)
=> zero = c(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_4) ).
fof(f17,conjecture,
zero = c(one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
zero != c(one),
inference(negated_conjecture,[],[f17]) ).
fof(f21,plain,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f22,plain,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f23,plain,
! [X0] :
( ~ test(X0)
=> zero = c(X0) ),
inference(rectify,[],[f16]) ).
fof(f24,plain,
zero != c(one),
inference(flattening,[],[f18]) ).
fof(f25,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f26,plain,
! [X0] :
( zero = c(X0)
| test(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f31,plain,
! [X0,X1] :
( ( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) )
& ( ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f32,plain,
! [X0,X1] :
( ( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) )
& ( ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X1,X0) ) ),
inference(flattening,[],[f31]) ).
fof(f33,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f25]) ).
fof(f34,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f36,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f43,plain,
! [X0] : zero = multiplication(X0,zero),
inference(cnf_transformation,[],[f10]) ).
fof(f44,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f50,plain,
! [X0,X1] :
( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f52,plain,
! [X0,X1] :
( c(X0) = X1
| ~ complement(X0,X1)
| ~ test(X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f53,plain,
! [X0] :
( zero = c(X0)
| test(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f54,plain,
zero != c(one),
inference(cnf_transformation,[],[f24]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f34]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f36]) ).
cnf(c_58,plain,
multiplication(X0,zero) = zero,
inference(cnf_transformation,[],[f43]) ).
cnf(c_59,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f44]) ).
cnf(c_62,plain,
( addition(X0,X1) != one
| multiplication(X0,X1) != zero
| multiplication(X1,X0) != zero
| complement(X1,X0) ),
inference(cnf_transformation,[],[f50]) ).
cnf(c_66,plain,
( ~ complement(X0,X1)
| ~ test(X0)
| c(X0) = X1 ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_68,plain,
( c(X0) = zero
| test(X0) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_69,negated_conjecture,
c(one) != zero,
inference(cnf_transformation,[],[f54]) ).
cnf(c_659,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_795,plain,
( c(one) = zero
| test(one) ),
inference(instantiation,[status(thm)],[c_68]) ).
cnf(c_817,plain,
( ~ complement(one,zero)
| ~ test(one)
| c(one) = zero ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_1054,plain,
( multiplication(X0,zero) != zero
| multiplication(zero,X0) != zero
| X0 != one
| complement(X0,zero) ),
inference(superposition,[status(thm)],[c_659,c_62]) ).
cnf(c_1063,plain,
( X0 != one
| complement(X0,zero) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1054,c_59,c_58]) ).
cnf(c_1142,plain,
complement(one,zero),
inference(equality_resolution,[status(thm)],[c_1063]) ).
cnf(c_1143,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1142,c_817,c_795,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE005+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n014.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 11:04:30 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.34/1.07 % SZS status Started for theBenchmark.p
% 2.34/1.07 % SZS status Theorem for theBenchmark.p
% 2.34/1.07
% 2.34/1.07 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.34/1.07
% 2.34/1.07 ------ iProver source info
% 2.34/1.07
% 2.34/1.07 git: date: 2023-05-31 18:12:56 +0000
% 2.34/1.07 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.34/1.07 git: non_committed_changes: false
% 2.34/1.07 git: last_make_outside_of_git: false
% 2.34/1.07
% 2.34/1.07 ------ Parsing...
% 2.34/1.07 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.34/1.07
% 2.34/1.07 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.34/1.07
% 2.34/1.07 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.34/1.07
% 2.34/1.07 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.34/1.07 ------ Proving...
% 2.34/1.07 ------ Problem Properties
% 2.34/1.07
% 2.34/1.07
% 2.34/1.07 clauses 21
% 2.34/1.07 conjectures 1
% 2.34/1.07 EPR 1
% 2.34/1.07 Horn 20
% 2.34/1.07 unary 12
% 2.34/1.07 binary 7
% 2.34/1.07 lits 33
% 2.34/1.07 lits eq 20
% 2.34/1.07 fd_pure 0
% 2.34/1.07 fd_pseudo 0
% 2.34/1.07 fd_cond 0
% 2.34/1.07 fd_pseudo_cond 1
% 2.34/1.07 AC symbols 1
% 2.34/1.07
% 2.34/1.07 ------ Schedule dynamic 5 is on
% 2.34/1.07
% 2.34/1.07 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.34/1.07
% 2.34/1.07
% 2.34/1.07 ------
% 2.34/1.07 Current options:
% 2.34/1.07 ------
% 2.34/1.07
% 2.34/1.07
% 2.34/1.07
% 2.34/1.07
% 2.34/1.07 ------ Proving...
% 2.34/1.07
% 2.34/1.07
% 2.34/1.07 % SZS status Theorem for theBenchmark.p
% 2.34/1.07
% 2.34/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.34/1.07
% 2.34/1.07
%------------------------------------------------------------------------------