TSTP Solution File: KLE022+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE022+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:44 EDT 2023
% Result : Theorem 0.89s 1.18s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 24 unt; 0 def)
% Number of atoms : 91 ( 56 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 77 ( 31 ~; 20 |; 15 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn; 48 !; 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(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(f14,axiom,
! [X3,X4] :
( complement(X4,X3)
<=> ( one = addition(X3,X4)
& zero = multiplication(X4,X3)
& zero = multiplication(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_2) ).
fof(f15,axiom,
! [X3,X4] :
( test(X3)
=> ( c(X3) = X4
<=> complement(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_3) ).
fof(f17,conjecture,
! [X3,X4] :
( test(X4)
=> addition(multiplication(X3,X4),multiplication(X3,c(X4))) = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X3,X4] :
( test(X4)
=> addition(multiplication(X3,X4),multiplication(X3,c(X4))) = 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(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(f24,plain,
~ ! [X0,X1] :
( test(X1)
=> addition(multiplication(X0,X1),multiplication(X0,c(X1))) = X0 ),
inference(rectify,[],[f18]) ).
fof(f25,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f27,plain,
? [X0,X1] :
( addition(multiplication(X0,X1),multiplication(X0,c(X1))) != X0
& test(X1) ),
inference(ennf_transformation,[],[f24]) ).
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(nnf_transformation,[],[f21]) ).
fof(f33,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,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f25]) ).
fof(f35,plain,
( ? [X0,X1] :
( addition(multiplication(X0,X1),multiplication(X0,c(X1))) != X0
& test(X1) )
=> ( sK1 != addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2)))
& test(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
( sK1 != addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2)))
& test(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f27,f35]) ).
fof(f37,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f38,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f19]) ).
fof(f42,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f44,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f52,plain,
! [X0,X1] :
( addition(X0,X1) = one
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f54,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f57,plain,
test(sK2),
inference(cnf_transformation,[],[f36]) ).
fof(f58,plain,
sK1 != addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2))),
inference(cnf_transformation,[],[f36]) ).
fof(f59,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f54]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f37]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f38]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f42]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f44]) ).
cnf(c_63,plain,
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_67,plain,
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(cnf_transformation,[],[f59]) ).
cnf(c_69,negated_conjecture,
addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2))) != sK1,
inference(cnf_transformation,[],[f58]) ).
cnf(c_70,negated_conjecture,
test(sK2),
inference(cnf_transformation,[],[f57]) ).
cnf(c_187,plain,
multiplication(sK1,addition(c(sK2),sK2)) != sK1,
inference(ac_demodulation,[status(thm)],[c_69,c_56,c_50,c_49]) ).
cnf(c_189,plain,
multiplication(sK1,addition(sK2,c(sK2))) != sK1,
inference(theory_normalisation,[status(thm)],[c_187,c_50,c_49]) ).
cnf(c_675,plain,
addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2))) != sK1,
inference(demodulation,[status(thm)],[c_189,c_56]) ).
cnf(c_730,plain,
( ~ test(X0)
| addition(c(X0),X0) = one ),
inference(superposition,[status(thm)],[c_67,c_63]) ).
cnf(c_731,plain,
( ~ test(X0)
| addition(X0,c(X0)) = one ),
inference(theory_normalisation,[status(thm)],[c_730,c_50,c_49]) ).
cnf(c_2584,plain,
addition(sK2,c(sK2)) = one,
inference(superposition,[status(thm)],[c_70,c_731]) ).
cnf(c_2609,plain,
addition(multiplication(X0,sK2),multiplication(X0,c(sK2))) = multiplication(X0,one),
inference(superposition,[status(thm)],[c_2584,c_56]) ).
cnf(c_2616,plain,
addition(multiplication(X0,sK2),multiplication(X0,c(sK2))) = X0,
inference(light_normalisation,[status(thm)],[c_2609,c_54]) ).
cnf(c_2620,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_675,c_2616]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE022+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 12:36:26 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.89/1.18 % SZS status Started for theBenchmark.p
% 0.89/1.18 % SZS status Theorem for theBenchmark.p
% 0.89/1.18
% 0.89/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.89/1.18
% 0.89/1.18 ------ iProver source info
% 0.89/1.18
% 0.89/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.89/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.89/1.18 git: non_committed_changes: false
% 0.89/1.18 git: last_make_outside_of_git: false
% 0.89/1.18
% 0.89/1.18 ------ Parsing...
% 0.89/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.89/1.18
% 0.89/1.18 ------ Preprocessing... sup_sim: 4 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.89/1.18
% 0.89/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.89/1.18
% 0.89/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.89/1.18 ------ Proving...
% 0.89/1.18 ------ Problem Properties
% 0.89/1.18
% 0.89/1.18
% 0.89/1.18 clauses 22
% 0.89/1.18 conjectures 1
% 0.89/1.18 EPR 2
% 0.89/1.18 Horn 21
% 0.89/1.18 unary 13
% 0.89/1.18 binary 7
% 0.89/1.18 lits 34
% 0.89/1.18 lits eq 20
% 0.89/1.18 fd_pure 0
% 0.89/1.18 fd_pseudo 0
% 0.89/1.18 fd_cond 0
% 0.89/1.18 fd_pseudo_cond 1
% 0.89/1.18 AC symbols 1
% 0.89/1.18
% 0.89/1.18 ------ Schedule dynamic 5 is on
% 0.89/1.18
% 0.89/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.89/1.18
% 0.89/1.18
% 0.89/1.18 ------
% 0.89/1.18 Current options:
% 0.89/1.18 ------
% 0.89/1.18
% 0.89/1.18
% 0.89/1.18
% 0.89/1.18
% 0.89/1.18 ------ Proving...
% 0.89/1.18
% 0.89/1.18
% 0.89/1.18 % SZS status Theorem for theBenchmark.p
% 0.89/1.18
% 0.89/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.89/1.18
% 0.89/1.18
%------------------------------------------------------------------------------