%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWV001-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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 : Thu Sep 24 09:02:26 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : Proof 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(less_or_equal_substitution1,axiom,
( less_or_equalish(Y,Z)
| ~ less_or_equalish(X,Z)
| ~ equalish(X,Y) ),
file('theBenchmark.p',less_or_equal_substitution1) ).
cnf(less_or_equal_substitution2,axiom,
( less_or_equalish(Z,Y)
| ~ less_or_equalish(Z,X)
| ~ equalish(X,Y) ),
file('theBenchmark.p',less_or_equal_substitution2) ).
cnf(clause_1,axiom,
( q2(X,Y,Z)
| ~ less_or_equalish(X,Y)
| ~ q1(X,Y,Z) ),
file('theBenchmark.p',clause_1) ).
cnf(clause_2,axiom,
( q3(X,Y,Z)
| less_or_equalish(X,Y)
| ~ q1(X,Y,Z) ),
file('theBenchmark.p',clause_2) ).
cnf(clause_3,axiom,
( q4(X,Y,Y)
| ~ q2(X,Y,Z) ),
file('theBenchmark.p',clause_3) ).
cnf(clause_4,axiom,
( q4(X,Y,X)
| ~ q3(X,Y,Z) ),
file('theBenchmark.p',clause_4) ).
cnf(less_or_equal_reflexivity,axiom,
less_or_equalish(X,X),
file('theBenchmark.p',less_or_equal_reflexivity) ).
cnf(less_or_equal_implies_equal,axiom,
( equalish(X,Y)
| ~ less_or_equalish(Y,X)
| ~ less_or_equalish(X,Y) ),
file('theBenchmark.p',less_or_equal_implies_equal) ).
cnf(transitivity_of_less_or_equal,axiom,
( less_or_equalish(X,Z)
| ~ less_or_equalish(Y,Z)
| ~ less_or_equalish(X,Y) ),
file('theBenchmark.p',transitivity_of_less_or_equal) ).
cnf(all_less_or_equal,axiom,
( less_or_equalish(Y,X)
| less_or_equalish(X,Y) ),
file('theBenchmark.p',all_less_or_equal) ).
cnf(equal_implies_less_or_equal,axiom,
( ~ equalish(X,Y)
| less_or_equalish(X,Y) ),
file('theBenchmark.p',equal_implies_less_or_equal) ).
cnf(clause_5,negated_conjecture,
q1(a,b,c),
file('theBenchmark.p',clause_5) ).
cnf(clause_6,negated_conjecture,
( ~ less_or_equalish(W,a)
| ~ less_or_equalish(b,W)
| ~ less_or_equalish(a,W)
| ~ q4(a,b,W) ),
file('theBenchmark.p',clause_6) ).
cnf(clause_7,negated_conjecture,
( ~ less_or_equalish(W,b)
| ~ less_or_equalish(b,W)
| ~ less_or_equalish(a,W)
| ~ q4(a,b,W) ),
file('theBenchmark.p',clause_7) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_EPR_NEQ_NHN problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.40 % Computer : n020.cluster.edu
% 0.10/0.40 % Model : x86_64 x86_64
% 0.10/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40 % Memory : 8046.5625MB
% 0.10/0.40 % OS : Linux 6.8.0-71-generic
% 0.10/0.40 % CPULimit : 300
% 0.10/0.40 % WCLimit : 300
% 0.10/0.40 % DateTime : Sun Sep 20 02:59:32 UTC 2026
% 0.10/0.40 % CPUTime :
% 0.10/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------