%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n001.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 May 5 07:07:28 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 10 RR)
% Number of literals : 10 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
equal(f(nil),btrue),
file('SWX233-1.p',unknown),
[] ).
cnf(9,axiom,
equal(eq(f(u),bfalse),prop1(u)),
file('SWX233-1.p',unknown),
[] ).
cnf(11,axiom,
equal(eq(btrue,bfalse),bfalse),
file('SWX233-1.p',unknown),
[] ).
cnf(12,axiom,
equal(eq(u,u),btrue),
file('SWX233-1.p',unknown),
[] ).
cnf(13,axiom,
~ equal(eq(prop1(u),bfalse),btrue),
file('SWX233-1.p',unknown),
[] ).
cnf(25,plain,
equal(eq(btrue,bfalse),prop1(nil)),
inference(spr,[status(thm),theory(equality)],[7,9]),
[iquote('0:SpR:7.0,9.0')] ).
cnf(26,plain,
equal(prop1(nil),bfalse),
inference(rew,[status(thm),theory(equality)],[11,25]),
[iquote('0:Rew:11.0,25.0')] ).
cnf(28,plain,
~ equal(eq(bfalse,bfalse),btrue),
inference(spl,[status(thm),theory(equality)],[26,13]),
[iquote('0:SpL:26.0,13.0')] ).
cnf(29,plain,
~ equal(btrue,btrue),
inference(rew,[status(thm),theory(equality)],[12,28]),
[iquote('0:Rew:12.0,28.0')] ).
cnf(30,plain,
$false,
inference(obv,[status(thm),theory(equality)],[29]),
[iquote('0:Obv:29.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.17/0.34 % Computer : n001.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue May 5 13:07:33 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.20/0.41
% 0.20/0.41 SPASS V 3.9
% 0.20/0.41 SPASS beiseite: Proof found.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41 SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 15 clauses.
% 0.20/0.41 SPASS allocated 63096 KBytes.
% 0.20/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.41 0:00:00.04 for the input.
% 0.20/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41 0:00:00.00 for inferences.
% 0.20/0.41 0:00:00.00 for the backtracking.
% 0.20/0.41 0:00:00.00 for the reduction.
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Here is a proof with depth 2, length 10 :
% 0.20/0.41 % SZS output start Refutation
% See solution above
% 0.20/0.41 Formulae used in the proof : axiom_006 axiom_008 axiom_010 axiom_011 goal
% 0.20/0.41
%------------------------------------------------------------------------------