TSTP Solution File: KLE024+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE024+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 8.01s 1.69s
% Output : CNFRefutation 8.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 56 ( 35 unt; 0 def)
% Number of atoms : 118 ( 75 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 91 ( 29 ~; 19 |; 29 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 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 : 89 ( 2 sgn; 59 !; 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(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).
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(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(f19,conjecture,
! [X3,X4,X5] :
( ( test(X5)
& test(X4) )
=> ( multiplication(c(X4),X3) = addition(multiplication(X3,c(X5)),multiplication(c(X4),X3))
=> zero = multiplication(multiplication(X4,X3),c(X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X3,X4,X5] :
( ( test(X5)
& test(X4) )
=> ( multiplication(c(X4),X3) = addition(multiplication(X3,c(X5)),multiplication(c(X4),X3))
=> zero = multiplication(multiplication(X4,X3),c(X5)) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f23,plain,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f24,plain,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f28,plain,
~ ! [X0,X1,X2] :
( ( test(X2)
& test(X1) )
=> ( multiplication(c(X1),X0) = addition(multiplication(X0,c(X2)),multiplication(c(X1),X0))
=> zero = multiplication(multiplication(X1,X0),c(X2)) ) ),
inference(rectify,[],[f20]) ).
fof(f29,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f35,plain,
? [X0,X1,X2] :
( zero != multiplication(multiplication(X1,X0),c(X2))
& multiplication(c(X1),X0) = addition(multiplication(X0,c(X2)),multiplication(c(X1),X0))
& test(X2)
& test(X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f36,plain,
? [X0,X1,X2] :
( zero != multiplication(multiplication(X1,X0),c(X2))
& multiplication(c(X1),X0) = addition(multiplication(X0,c(X2)),multiplication(c(X1),X0))
& test(X2)
& test(X1) ),
inference(flattening,[],[f35]) ).
fof(f41,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,[],[f23]) ).
fof(f42,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,[],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f29]) ).
fof(f44,plain,
( ? [X0,X1,X2] :
( zero != multiplication(multiplication(X1,X0),c(X2))
& multiplication(c(X1),X0) = addition(multiplication(X0,c(X2)),multiplication(c(X1),X0))
& test(X2)
& test(X1) )
=> ( zero != multiplication(multiplication(sK2,sK1),c(sK3))
& multiplication(c(sK2),sK1) = addition(multiplication(sK1,c(sK3)),multiplication(c(sK2),sK1))
& test(sK3)
& test(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
( zero != multiplication(multiplication(sK2,sK1),c(sK3))
& multiplication(c(sK2),sK1) = addition(multiplication(sK1,c(sK3)),multiplication(c(sK2),sK1))
& test(sK3)
& test(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f36,f44]) ).
fof(f46,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f47,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f21]) ).
fof(f48,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f50,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f53,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f56,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f60,plain,
! [X0,X1] :
( zero = multiplication(X1,X0)
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f63,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f68,plain,
test(sK2),
inference(cnf_transformation,[],[f45]) ).
fof(f70,plain,
multiplication(c(sK2),sK1) = addition(multiplication(sK1,c(sK3)),multiplication(c(sK2),sK1)),
inference(cnf_transformation,[],[f45]) ).
fof(f71,plain,
zero != multiplication(multiplication(sK2,sK1),c(sK3)),
inference(cnf_transformation,[],[f45]) ).
fof(f72,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f63]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f46]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f47]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f48]) ).
cnf(c_53,plain,
multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f50]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f53]) ).
cnf(c_59,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f56]) ).
cnf(c_64,plain,
( ~ complement(X0,X1)
| multiplication(X0,X1) = zero ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_67,plain,
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(cnf_transformation,[],[f72]) ).
cnf(c_71,negated_conjecture,
multiplication(multiplication(sK2,sK1),c(sK3)) != zero,
inference(cnf_transformation,[],[f71]) ).
cnf(c_72,negated_conjecture,
addition(multiplication(sK1,c(sK3)),multiplication(c(sK2),sK1)) = multiplication(c(sK2),sK1),
inference(cnf_transformation,[],[f70]) ).
cnf(c_74,negated_conjecture,
test(sK2),
inference(cnf_transformation,[],[f68]) ).
cnf(c_209,plain,
multiplication(sK2,multiplication(sK1,c(sK3))) != zero,
inference(demodulation,[status(thm)],[c_71,c_53]) ).
cnf(c_643,plain,
addition(multiplication(c(sK2),sK1),multiplication(sK1,c(sK3))) = multiplication(c(sK2),sK1),
inference(theory_normalisation,[status(thm)],[c_72,c_50,c_49]) ).
cnf(c_682,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_822,plain,
( ~ test(X0)
| multiplication(X0,c(X0)) = zero ),
inference(superposition,[status(thm)],[c_67,c_64]) ).
cnf(c_1145,plain,
addition(multiplication(X0,multiplication(c(sK2),sK1)),multiplication(X0,multiplication(sK1,c(sK3)))) = multiplication(X0,multiplication(c(sK2),sK1)),
inference(superposition,[status(thm)],[c_643,c_56]) ).
cnf(c_3935,plain,
multiplication(sK2,c(sK2)) = zero,
inference(superposition,[status(thm)],[c_74,c_822]) ).
cnf(c_3991,plain,
multiplication(sK2,multiplication(c(sK2),X0)) = multiplication(zero,X0),
inference(superposition,[status(thm)],[c_3935,c_53]) ).
cnf(c_3995,plain,
multiplication(sK2,multiplication(c(sK2),X0)) = zero,
inference(light_normalisation,[status(thm)],[c_3991,c_59]) ).
cnf(c_4779,plain,
addition(zero,multiplication(sK2,multiplication(sK1,c(sK3)))) = zero,
inference(superposition,[status(thm)],[c_3995,c_1145]) ).
cnf(c_20576,plain,
multiplication(sK2,multiplication(sK1,c(sK3))) = zero,
inference(demodulation,[status(thm)],[c_4779,c_682]) ).
cnf(c_20577,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_20576,c_209]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE024+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n009.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 29 12:01:05 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 8.01/1.69 % SZS status Started for theBenchmark.p
% 8.01/1.69 % SZS status Theorem for theBenchmark.p
% 8.01/1.69
% 8.01/1.69 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 8.01/1.69
% 8.01/1.69 ------ iProver source info
% 8.01/1.69
% 8.01/1.69 git: date: 2023-05-31 18:12:56 +0000
% 8.01/1.69 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 8.01/1.69 git: non_committed_changes: false
% 8.01/1.69 git: last_make_outside_of_git: false
% 8.01/1.69
% 8.01/1.69 ------ Parsing...
% 8.01/1.69 ------ Clausification by vclausify_rel & Parsing by iProver...
% 8.01/1.69
% 8.01/1.69 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e
% 8.01/1.69
% 8.01/1.69 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.01/1.69
% 8.01/1.69 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.01/1.69 ------ Proving...
% 8.01/1.69 ------ Problem Properties
% 8.01/1.69
% 8.01/1.69
% 8.01/1.69 clauses 26
% 8.01/1.69 conjectures 3
% 8.01/1.69 EPR 3
% 8.01/1.69 Horn 25
% 8.01/1.69 unary 15
% 8.01/1.69 binary 7
% 8.01/1.69 lits 42
% 8.01/1.69 lits eq 23
% 8.01/1.69 fd_pure 0
% 8.01/1.69 fd_pseudo 0
% 8.01/1.69 fd_cond 0
% 8.01/1.69 fd_pseudo_cond 1
% 8.01/1.69 AC symbols 1
% 8.01/1.69
% 8.01/1.69 ------ Schedule dynamic 5 is on
% 8.01/1.69
% 8.01/1.69 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.01/1.69
% 8.01/1.69
% 8.01/1.69 ------
% 8.01/1.69 Current options:
% 8.01/1.69 ------
% 8.01/1.69
% 8.01/1.69
% 8.01/1.69
% 8.01/1.69
% 8.01/1.69 ------ Proving...
% 8.01/1.69
% 8.01/1.69
% 8.01/1.69 % SZS status Theorem for theBenchmark.p
% 8.01/1.69
% 8.01/1.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.01/1.69
% 8.01/1.69
%------------------------------------------------------------------------------