TSTP Solution File: KLE007+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : KLE007+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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 : Tue Apr 30 20:24:07 EDT 2024
% Result : Theorem 0.14s 0.36s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 17 unt; 0 def)
% Number of atoms : 76 ( 43 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 75 ( 32 ~; 21 |; 16 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 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 : 36 ( 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [A] : multiplication(one,A) = A,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,conjecture,
! [X0,X1] :
( ( test(X1)
& test(X0) )
=> one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
~ ! [X0,X1] :
( ( test(X1)
& test(X0) )
=> one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f25,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f39,plain,
! [X0,X1] :
( ( ~ complement(X1,X0)
| ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one ) )
& ( complement(X1,X0)
| multiplication(X0,X1) != zero
| multiplication(X1,X0) != zero
| addition(X0,X1) != one ) ),
inference(NNF_transformation,[status(esa)],[f14]) ).
fof(f40,plain,
( ! [X0,X1] :
( ~ complement(X1,X0)
| ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one ) )
& ! [X0,X1] :
( complement(X1,X0)
| multiplication(X0,X1) != zero
| multiplication(X1,X0) != zero
| addition(X0,X1) != one ) ),
inference(miniscoping,[status(esa)],[f39]) ).
fof(f43,plain,
! [X0,X1] :
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(cnf_transformation,[status(esa)],[f40]) ).
fof(f45,plain,
! [X0,X1] :
( ~ test(X0)
| ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(pre_NNF_transformation,[status(esa)],[f15]) ).
fof(f46,plain,
! [X0,X1] :
( ~ test(X0)
| ( ( c(X0) != X1
| complement(X0,X1) )
& ( c(X0) = X1
| ~ complement(X0,X1) ) ) ),
inference(NNF_transformation,[status(esa)],[f45]) ).
fof(f47,plain,
! [X0] :
( ~ test(X0)
| ( ! [X1] :
( c(X0) != X1
| complement(X0,X1) )
& ! [X1] :
( c(X0) = X1
| ~ complement(X0,X1) ) ) ),
inference(miniscoping,[status(esa)],[f46]) ).
fof(f48,plain,
! [X0,X1] :
( ~ test(X0)
| c(X0) != X1
| complement(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f47]) ).
fof(f52,plain,
? [X0,X1] :
( test(X1)
& test(X0)
& one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
inference(pre_NNF_transformation,[status(esa)],[f18]) ).
fof(f53,plain,
( test(sk0_2)
& test(sk0_1)
& one != addition(multiplication(addition(sk0_1,c(sk0_1)),sk0_2),multiplication(addition(sk0_1,c(sk0_1)),c(sk0_2))) ),
inference(skolemization,[status(esa)],[f52]) ).
fof(f54,plain,
test(sk0_2),
inference(cnf_transformation,[status(esa)],[f53]) ).
fof(f55,plain,
test(sk0_1),
inference(cnf_transformation,[status(esa)],[f53]) ).
fof(f56,plain,
one != addition(multiplication(addition(sk0_1,c(sk0_1)),sk0_2),multiplication(addition(sk0_1,c(sk0_1)),c(sk0_2))),
inference(cnf_transformation,[status(esa)],[f53]) ).
fof(f57,plain,
! [X0] :
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(destructive_equality_resolution,[status(esa)],[f48]) ).
fof(f59,plain,
! [X0] :
( addition(c(X0),X0) = one
| ~ test(X0) ),
inference(resolution,[status(thm)],[f43,f57]) ).
fof(f60,plain,
! [X0] :
( addition(X0,c(X0)) = one
| ~ test(X0) ),
inference(forward_demodulation,[status(thm)],[f19,f59]) ).
fof(f62,plain,
addition(sk0_1,c(sk0_1)) = one,
inference(resolution,[status(thm)],[f60,f55]) ).
fof(f63,plain,
addition(sk0_2,c(sk0_2)) = one,
inference(resolution,[status(thm)],[f60,f54]) ).
fof(f65,plain,
one != addition(multiplication(addition(sk0_1,c(sk0_1)),sk0_2),multiplication(one,c(sk0_2))),
inference(backward_demodulation,[status(thm)],[f62,f56]) ).
fof(f66,plain,
one != addition(multiplication(one,c(sk0_2)),multiplication(addition(sk0_1,c(sk0_1)),sk0_2)),
inference(forward_demodulation,[status(thm)],[f19,f65]) ).
fof(f67,plain,
one != addition(c(sk0_2),multiplication(addition(sk0_1,c(sk0_1)),sk0_2)),
inference(forward_demodulation,[status(thm)],[f25,f66]) ).
fof(f68,plain,
one != addition(c(sk0_2),multiplication(one,sk0_2)),
inference(forward_demodulation,[status(thm)],[f62,f67]) ).
fof(f69,plain,
one != addition(c(sk0_2),sk0_2),
inference(forward_demodulation,[status(thm)],[f25,f68]) ).
fof(f70,plain,
one != addition(sk0_2,c(sk0_2)),
inference(forward_demodulation,[status(thm)],[f19,f69]) ).
fof(f119,plain,
one != one,
inference(forward_demodulation,[status(thm)],[f63,f70]) ).
fof(f120,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KLE007+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Apr 30 01:20:17 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % Drodi V3.6.0
% 0.14/0.36 % Refutation found
% 0.14/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.37 % Elapsed time: 0.024469 seconds
% 0.14/0.37 % CPU time: 0.042618 seconds
% 0.14/0.37 % Total memory used: 12.969 MB
% 0.14/0.37 % Net memory used: 12.918 MB
%------------------------------------------------------------------------------