%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE114+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:44:20 AM UTC 2026
% Result : Theorem 0.10s 0.40s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 11
% Syntax : Number of formulae : 51 ( 51 unt; 0 def)
% Number of atoms : 51 ( 50 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 23 ( 23 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 12 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 1 sgn 15 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('theBenchmark.p',additive_commutativity) ).
fof(additive_identity,axiom,
! [A] : addition(A,zero) = A,
file('theBenchmark.p',additive_identity) ).
fof(multiplicative_right_identity,axiom,
! [A] : multiplication(A,one) = A,
file('theBenchmark.p',multiplicative_right_identity) ).
fof(right_annihilation,axiom,
! [A] : multiplication(A,zero) = zero,
file('theBenchmark.p',right_annihilation) ).
fof(domain1,axiom,
! [X0] : multiplication(antidomain(X0),X0) = zero,
file('theBenchmark.p',domain1) ).
fof(domain3,axiom,
! [X0] : addition(antidomain(antidomain(X0)),antidomain(X0)) = one,
file('theBenchmark.p',domain3) ).
fof(domain4,axiom,
! [X0] : domain(X0) = antidomain(antidomain(X0)),
file('theBenchmark.p',domain4) ).
fof(complement,axiom,
! [X0] : c(X0) = antidomain(domain(X0)),
file('theBenchmark.p',complement) ).
fof(forward_diamond,axiom,
! [X0,X1] : forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1))),
file('theBenchmark.p',forward_diamond) ).
fof(forward_box,axiom,
! [X0,X1] : forward_box(X0,X1) = c(forward_diamond(X0,c(X1))),
file('theBenchmark.p',forward_box) ).
fof(goals,conjecture,
! [X0] : forward_box(X0,one) = one,
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0] : forward_box(X0,one) = one,
inference(assume_negation,[status(cth)],[goals]) ).
fof(nnf_27,plain,
? [X0] : forward_box(X0,one) != one,
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
forward_box(sK0,one) != one,
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[nnf_27]) ).
cnf(c_30,negated_conjecture,
forward_box(sK0,one) != one,
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_32,plain,
forward_box(A,B) = c(forward_diamond(A,c(B))),
inference(clausify,[status(thm)],[forward_box]) ).
cnf(c_34,plain,
forward_diamond(A,B) = domain(multiplication(A,domain(B))),
inference(clausify,[status(thm)],[forward_diamond]) ).
cnf(c_36,plain,
c(A) = antidomain(domain(A)),
inference(clausify,[status(thm)],[complement]) ).
cnf(c_42,plain,
domain(A) = antidomain(antidomain(A)),
inference(clausify,[status(thm)],[domain4]) ).
cnf(c_43,plain,
addition(antidomain(antidomain(A)),antidomain(A)) = one,
inference(clausify,[status(thm)],[domain3]) ).
cnf(c_46,plain,
multiplication(antidomain(A),A) = zero,
inference(clausify,[status(thm)],[domain1]) ).
cnf(c_48,plain,
multiplication(A,zero) = zero,
inference(clausify,[status(thm)],[right_annihilation]) ).
cnf(c_54,plain,
multiplication(A,one) = A,
inference(clausify,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_57,plain,
addition(A,zero) = A,
inference(clausify,[status(thm)],[additive_identity]) ).
cnf(c_59,plain,
addition(A,B) = addition(B,A),
inference(clausify,[status(thm)],[additive_commutativity]) ).
cnf(c_138,negated_conjecture,
c(forward_diamond(sK0,c(one))) != one,
inference(paramod,[status(thm)],[c_32,c_30]) ).
cnf(c_139,negated_conjecture,
c(forward_diamond(sK0,antidomain(domain(one)))) != one,
inference(paramod,[status(thm)],[c_36,c_138]) ).
cnf(c_140,negated_conjecture,
c(forward_diamond(sK0,antidomain(antidomain(antidomain(one))))) != one,
inference(paramod,[status(thm)],[c_42,c_139]) ).
cnf(c_141,negated_conjecture,
c(domain(multiplication(sK0,domain(antidomain(antidomain(antidomain(one))))))) != one,
inference(paramod,[status(thm)],[c_34,c_140]) ).
cnf(c_142,negated_conjecture,
c(domain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(antidomain(one)))))))) != one,
inference(paramod,[status(thm)],[c_42,c_141]) ).
cnf(c_143,negated_conjecture,
c(antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(antidomain(one))))))))) != one,
inference(paramod,[status(thm)],[c_42,c_142]) ).
cnf(c_144,negated_conjecture,
antidomain(domain(antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(antidomain(one)))))))))) != one,
inference(paramod,[status(thm)],[c_36,c_143]) ).
cnf(c_60,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(antidomain(one))))))))))) != one,
inference(paramod,[status(thm)],[c_42,c_144]) ).
cnf(c_67,plain,
addition(antidomain(A),antidomain(antidomain(A))) = one,
inference(paramod,[status(thm)],[c_59,c_43]) ).
cnf(c_101,plain,
antidomain(one) = zero,
inference(paramod,[status(thm)],[c_54,c_46]) ).
cnf(c_105,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(zero)))))))))) != one,
inference(paramod,[status(thm)],[c_101,c_60]) ).
cnf(c_124,plain,
addition(zero,A) = A,
inference(paramod,[status(thm)],[c_59,c_57]) ).
cnf(c_145,plain,
addition(zero,antidomain(antidomain(one))) = one,
inference(paramod,[status(thm)],[c_101,c_67]) ).
cnf(c_146,plain,
addition(zero,antidomain(zero)) = one,
inference(paramod,[status(thm)],[c_101,c_145]) ).
cnf(c_136,plain,
antidomain(zero) = one,
inference(paramod,[status(thm)],[c_124,c_146]) ).
cnf(c_147,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(one))))))))) != one,
inference(paramod,[status(thm)],[c_136,c_105]) ).
cnf(c_148,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,antidomain(antidomain(zero)))))))) != one,
inference(paramod,[status(thm)],[c_101,c_147]) ).
cnf(c_149,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,antidomain(one))))))) != one,
inference(paramod,[status(thm)],[c_136,c_148]) ).
cnf(c_150,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,zero)))))) != one,
inference(paramod,[status(thm)],[c_101,c_149]) ).
cnf(c_151,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(zero))))) != one,
inference(paramod,[status(thm)],[c_48,c_150]) ).
cnf(c_152,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(one)))) != one,
inference(paramod,[status(thm)],[c_136,c_151]) ).
cnf(c_153,negated_conjecture,
antidomain(antidomain(antidomain(zero))) != one,
inference(paramod,[status(thm)],[c_101,c_152]) ).
cnf(c_154,negated_conjecture,
antidomain(antidomain(one)) != one,
inference(paramod,[status(thm)],[c_136,c_153]) ).
cnf(c_155,negated_conjecture,
antidomain(zero) != one,
inference(paramod,[status(thm)],[c_101,c_154]) ).
cnf(c_156,negated_conjecture,
one != one,
inference(paramod,[status(thm)],[c_136,c_155]) ).
cnf(c_137,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE114+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 19:23:50 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 1453739 was started by sandbox2 on n010,
% 0.10/0.37 % Fri Sep 25 19:23:50 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 0.10/0.40
% 0.10/0.40 % SZS status Theorem for theBenchmark
% 0.10/0.40
% 0.10/0.40 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.10/0.40 % Length of proof is 29.
% 0.10/0.40 % Level of proof is 4.
% 0.10/0.40 % Maximum clause weight is 15.000.
% 0.10/0.40 % Given clauses 29.
% 0.10/0.40
% 0.10/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------