%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SWX233-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n006.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 : Tue Sep 29 01:45:38 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.34s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 11 RR)
% Number of literals : 13 ( 12 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 3 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
eq(prop1(X),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c2,axiom,
prop1(X2) = eq(f(X2),bfalse),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_008) ).
cnf(c3,plain,
prop1(nil) = eq(f(nil),bfalse),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,axiom,
f(nil) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c5,plain,
eq(f(nil),bfalse) = eq(btrue,bfalse),
inference(congruence,[status(thm)],[c4]) ).
cnf(c6,axiom,
eq(btrue,bfalse) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c7,plain,
eq(f(nil),bfalse) = bfalse,
inference(transitivity,[status(thm)],[c5,c6]) ).
cnf(c8,plain,
prop1(nil) = bfalse,
inference(transitivity,[status(thm)],[c3,c7]) ).
cnf(c9,plain,
eq(prop1(nil),bfalse) = eq(bfalse,bfalse),
inference(congruence,[status(thm)],[c8]) ).
cnf(c10,axiom,
eq(X2,X2) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_011) ).
cnf(c11,plain,
eq(bfalse,bfalse) = btrue,
inference(substitution,[status(thm)],[c10]) ).
cnf(c12,plain,
eq(prop1(nil),bfalse) = btrue,
inference(transitivity,[status(thm)],[c9,c11]) ).
cnf(c13,plain,
$false,
inference(resolution,[status(thm)],[c1,c12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWX233-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.24 % Computer : n006.cluster.edu
% 0.11/0.24 % Model : x86_64 x86_64
% 0.11/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.24 % Memory : 8046.5625MB
% 0.11/0.24 % OS : Linux 6.8.0-71-generic
% 0.11/0.24 % CPULimit : 300
% 0.11/0.24 % WCLimit : 300
% 0.11/0.24 % DateTime : Mon Sep 28 15:17:09 UTC 2026
% 0.11/0.25 % CPUTime :
% 0.11/0.25 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.34 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.24/0.34
% 0.24/0.34 % SZS status Unsatisfiable
% 0.24/0.34
% 0.24/0.34 % SZS output start CNFRefutation
% See solution above
% 0.24/0.35
% 0.24/0.35 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------