%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : FLD039-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:11:34 AM UTC 2026
% Result : Unsatisfiable 0.06s 0.43s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(symmetry_of_equality,axiom,
! [VAR_0,VAR_1] :
( ~ equalish(VAR_1,VAR_0)
| equalish(VAR_0,VAR_1) ),
file('theBenchmark.p',symmetry_of_equality) ).
cnf(c_22,plain,
( ~ equalish(B,A)
| equalish(A,B) ),
inference(clausify,[status(thm)],[symmetry_of_equality]) ).
fof(different_identities,axiom,
~ equalish(additive_identity,multiplicative_identity),
file('theBenchmark.p',different_identities) ).
cnf(c_27,plain,
~ equalish(additive_identity,multiplicative_identity),
inference(clausify,[status(thm)],[different_identities]) ).
fof(multiplicative_identity_equals_additive_identity_3,axiom,
equalish(multiplicative_identity,additive_identity),
file('theBenchmark.p',multiplicative_identity_equals_additive_identity_3) ).
cnf(c_30,plain,
equalish(multiplicative_identity,additive_identity),
inference(clausify,[status(thm)],[multiplicative_identity_equals_additive_identity_3]) ).
cnf(c_125,plain,
~ equalish(multiplicative_identity,additive_identity),
inference(resolve,[status(thm)],[c_22,c_27]) ).
cnf(c_124,plain,
$false,
inference(resolve,[status(thm)],[c_30,c_125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD039-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.38 % Computer : n003.cluster.edu
% 0.06/0.38 % Model : x86_64 x86_64
% 0.06/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.38 % Memory : 8046.5625MB
% 0.06/0.38 % OS : Linux 6.8.0-71-generic
% 0.06/0.38 % CPULimit : 300
% 0.06/0.38 % WCLimit : 300
% 0.06/0.38 % DateTime : Sun Sep 27 02:28:10 UTC 2026
% 0.06/0.38 % CPUTime :
% 0.06/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.06/0.38 % Process 82656 was started by sandbox on n003,
% 0.06/0.38 % Sun Sep 27 02:28:10 2026
% 0.06/0.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.06/0.39
% 0.06/0.39 % From the command line: assign(max_seconds, 300).
% 0.06/0.43
% 0.06/0.43 % SZS status Unsatisfiable for theBenchmark
% 0.06/0.43
% 0.06/0.43 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.06/0.43 % Length of proof is 4.
% 0.06/0.43 % Level of proof is 1.
% 0.06/0.43 % Maximum clause weight is 11.000.
% 0.06/0.43 % Given clauses 27.
% 0.06/0.43
% 0.06/0.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------