TSTP Solution File: KLE025+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE025+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:46 EDT 2023
% Result : Theorem 7.45s 1.61s
% Output : CNFRefutation 7.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 34 unt; 0 def)
% Number of atoms : 145 ( 101 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 132 ( 53 ~; 36 |; 29 &)
% ( 5 <=>; 9 =>; 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 94 ( 0 sgn; 53 !; 9 ?)
% 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(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/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/sandbox/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/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(f17,conjecture,
! [X3,X4,X5] :
( ( test(X5)
& test(X4) )
=> ( zero = multiplication(multiplication(X4,X3),c(X5))
=> multiplication(X4,X3) = multiplication(multiplication(X4,X3),X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X3,X4,X5] :
( ( test(X5)
& test(X4) )
=> ( zero = multiplication(multiplication(X4,X3),c(X5))
=> multiplication(X4,X3) = multiplication(multiplication(X4,X3),X5) ) ),
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,X2] :
( ( test(X2)
& test(X1) )
=> ( zero = multiplication(multiplication(X1,X0),c(X2))
=> multiplication(X1,X0) = multiplication(multiplication(X1,X0),X2) ) ),
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,X2] :
( multiplication(X1,X0) != multiplication(multiplication(X1,X0),X2)
& zero = multiplication(multiplication(X1,X0),c(X2))
& test(X2)
& test(X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f28,plain,
? [X0,X1,X2] :
( multiplication(X1,X0) != multiplication(multiplication(X1,X0),X2)
& zero = multiplication(multiplication(X1,X0),c(X2))
& test(X2)
& test(X1) ),
inference(flattening,[],[f27]) ).
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(nnf_transformation,[],[f21]) ).
fof(f34,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,[],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f25]) ).
fof(f36,plain,
( ? [X0,X1,X2] :
( multiplication(X1,X0) != multiplication(multiplication(X1,X0),X2)
& zero = multiplication(multiplication(X1,X0),c(X2))
& test(X2)
& test(X1) )
=> ( multiplication(sK2,sK1) != multiplication(multiplication(sK2,sK1),sK3)
& zero = multiplication(multiplication(sK2,sK1),c(sK3))
& test(sK3)
& test(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
( multiplication(sK2,sK1) != multiplication(multiplication(sK2,sK1),sK3)
& zero = multiplication(multiplication(sK2,sK1),c(sK3))
& test(sK3)
& test(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f28,f36]) ).
fof(f38,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f39,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f19]) ).
fof(f40,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f43,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f45,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f53,plain,
! [X0,X1] :
( addition(X0,X1) = one
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f55,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f59,plain,
test(sK3),
inference(cnf_transformation,[],[f37]) ).
fof(f60,plain,
zero = multiplication(multiplication(sK2,sK1),c(sK3)),
inference(cnf_transformation,[],[f37]) ).
fof(f61,plain,
multiplication(sK2,sK1) != multiplication(multiplication(sK2,sK1),sK3),
inference(cnf_transformation,[],[f37]) ).
fof(f62,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f55]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f38]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f39]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f40]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f43]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f45]) ).
cnf(c_63,plain,
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_67,plain,
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_69,negated_conjecture,
multiplication(multiplication(sK2,sK1),sK3) != multiplication(sK2,sK1),
inference(cnf_transformation,[],[f61]) ).
cnf(c_70,negated_conjecture,
multiplication(multiplication(sK2,sK1),c(sK3)) = zero,
inference(cnf_transformation,[],[f60]) ).
cnf(c_71,negated_conjecture,
test(sK3),
inference(cnf_transformation,[],[f59]) ).
cnf(c_432,plain,
X0 = X0,
theory(equality) ).
cnf(c_434,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_706,plain,
( multiplication(multiplication(sK2,sK1),sK3) != X0
| multiplication(sK2,sK1) != X0 ),
inference(resolution,[status(thm)],[c_434,c_69]) ).
cnf(c_714,plain,
( multiplication(multiplication(sK2,sK1),sK3) != X0
| multiplication(sK2,sK1) != X1
| X1 != X0 ),
inference(resolution,[status(thm)],[c_706,c_434]) ).
cnf(c_805,plain,
( ~ test(X0)
| addition(c(X0),X0) = one ),
inference(superposition,[status(thm)],[c_67,c_63]) ).
cnf(c_806,plain,
( ~ test(X0)
| addition(X0,c(X0)) = one ),
inference(theory_normalisation,[status(thm)],[c_805,c_50,c_49]) ).
cnf(c_890,plain,
( multiplication(multiplication(sK2,sK1),sK3) != X0
| multiplication(sK2,sK1) != multiplication(X0,one) ),
inference(resolution,[status(thm)],[c_714,c_54]) ).
cnf(c_952,plain,
addition(sK3,c(sK3)) = one,
inference(superposition,[status(thm)],[c_71,c_806]) ).
cnf(c_1014,plain,
( multiplication(sK2,sK1) != X0
| X1 != X0
| multiplication(sK2,sK1) = X1 ),
inference(instantiation,[status(thm)],[c_434]) ).
cnf(c_1099,plain,
( multiplication(multiplication(sK2,sK1),sK3) != X0
| multiplication(sK2,sK1) != multiplication(X1,one)
| X1 != X0 ),
inference(resolution,[status(thm)],[c_890,c_434]) ).
cnf(c_1861,plain,
( multiplication(sK2,sK1) != multiplication(sK2,sK1)
| X0 != multiplication(sK2,sK1)
| multiplication(sK2,sK1) = X0 ),
inference(instantiation,[status(thm)],[c_1014]) ).
cnf(c_1862,plain,
multiplication(sK2,sK1) = multiplication(sK2,sK1),
inference(instantiation,[status(thm)],[c_432]) ).
cnf(c_4347,plain,
( multiplication(multiplication(sK2,sK1),one) != multiplication(sK2,sK1)
| multiplication(sK2,sK1) != multiplication(sK2,sK1)
| multiplication(sK2,sK1) = multiplication(multiplication(sK2,sK1),one) ),
inference(instantiation,[status(thm)],[c_1861]) ).
cnf(c_4348,plain,
multiplication(multiplication(sK2,sK1),one) = multiplication(sK2,sK1),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_5204,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_5414,plain,
multiplication(multiplication(sK2,sK1),addition(X0,c(sK3))) = addition(multiplication(multiplication(sK2,sK1),X0),zero),
inference(superposition,[status(thm)],[c_70,c_56]) ).
cnf(c_5435,plain,
multiplication(multiplication(sK2,sK1),addition(X0,c(sK3))) = addition(zero,multiplication(multiplication(sK2,sK1),X0)),
inference(theory_normalisation,[status(thm)],[c_5414,c_50,c_49]) ).
cnf(c_6151,plain,
addition(zero,multiplication(multiplication(sK2,sK1),sK3)) = multiplication(multiplication(sK2,sK1),one),
inference(superposition,[status(thm)],[c_952,c_5435]) ).
cnf(c_7346,plain,
multiplication(multiplication(sK2,sK1),one) = multiplication(multiplication(sK2,sK1),sK3),
inference(superposition,[status(thm)],[c_6151,c_5204]) ).
cnf(c_7805,plain,
( multiplication(multiplication(sK2,sK1),sK3) != multiplication(multiplication(sK2,sK1),one)
| multiplication(sK2,sK1) != multiplication(multiplication(sK2,sK1),one) ),
inference(factoring,[status(thm)],[c_1099]) ).
cnf(c_7806,plain,
multiplication(multiplication(sK2,sK1),sK3) != multiplication(multiplication(sK2,sK1),one),
inference(global_subsumption_just,[status(thm)],[c_7805,c_1862,c_4347,c_4348,c_7805]) ).
cnf(c_7940,plain,
( multiplication(multiplication(sK2,sK1),one) != X0
| multiplication(multiplication(sK2,sK1),sK3) != X0 ),
inference(resolution,[status(thm)],[c_7806,c_434]) ).
cnf(c_8327,plain,
multiplication(multiplication(sK2,sK1),one) != multiplication(multiplication(sK2,sK1),sK3),
inference(resolution,[status(thm)],[c_7940,c_432]) ).
cnf(c_8328,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8327,c_7346]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : KLE025+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 29 12:13:01 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.45/1.61 % SZS status Started for theBenchmark.p
% 7.45/1.61 % SZS status Theorem for theBenchmark.p
% 7.45/1.61
% 7.45/1.61 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.45/1.61
% 7.45/1.61 ------ iProver source info
% 7.45/1.61
% 7.45/1.61 git: date: 2023-05-31 18:12:56 +0000
% 7.45/1.61 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.45/1.61 git: non_committed_changes: false
% 7.45/1.61 git: last_make_outside_of_git: false
% 7.45/1.61
% 7.45/1.61 ------ Parsing...
% 7.45/1.61 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.45/1.61
% 7.45/1.61 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.45/1.61
% 7.45/1.61 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.45/1.61
% 7.45/1.61 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.45/1.61 ------ Proving...
% 7.45/1.61 ------ Problem Properties
% 7.45/1.61
% 7.45/1.61
% 7.45/1.61 clauses 24
% 7.45/1.61 conjectures 4
% 7.45/1.61 EPR 3
% 7.45/1.61 Horn 23
% 7.45/1.61 unary 15
% 7.45/1.61 binary 7
% 7.45/1.61 lits 36
% 7.45/1.61 lits eq 21
% 7.45/1.61 fd_pure 0
% 7.45/1.61 fd_pseudo 0
% 7.45/1.61 fd_cond 0
% 7.45/1.61 fd_pseudo_cond 1
% 7.45/1.61 AC symbols 1
% 7.45/1.61
% 7.45/1.61 ------ Input Options Time Limit: Unbounded
% 7.45/1.61
% 7.45/1.61
% 7.45/1.61 ------
% 7.45/1.61 Current options:
% 7.45/1.61 ------
% 7.45/1.61
% 7.45/1.61
% 7.45/1.61
% 7.45/1.61
% 7.45/1.61 ------ Proving...
% 7.45/1.61
% 7.45/1.61
% 7.45/1.61 % SZS status Theorem for theBenchmark.p
% 7.45/1.61
% 7.45/1.61 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.45/1.61
% 7.45/1.62
%------------------------------------------------------------------------------