%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWV690-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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:04:11 AM UTC 2026
% Result : Unsatisfiable 32.63s 32.91s
% Output : Proof 32.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 3 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_less__imp__diff__less_0,axiom,
( ~ c_HOL_Oord__class_Oless(V_j,V_k,tc_nat)
| c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(V_j,V_n,tc_nat),V_k,tc_nat) ),
file('theBenchmark.p',cls_less__imp__diff__less_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_HOL_Oord__class_Oless(v_k,v_n,tc_nat),
file('theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(v_k,v_i,tc_nat),v_n,tc_nat),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(t1,plain,
c_HOL_Oord__class_Oless(v_k,v_n,tc_nat),
inference(start,[status(thm),parent(0:0)],[cls_conjecture_0]) ).
cnf(t2,plain,
( c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(v_k,v_i,tc_nat),v_n,tc_nat)
| ~ c_HOL_Oord__class_Oless(v_k,v_n,tc_nat) ),
inference(extension,[status(thm),parent(t1:1)],[cls_less__imp__diff__less_0]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
~ c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(v_k,v_i,tc_nat),v_n,tc_nat),
inference(extension,[status(thm),parent(t2:2)],[cls_conjecture_1]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV690-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.36 % Computer : n018.cluster.edu
% 0.07/0.36 % Model : x86_64 x86_64
% 0.07/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.36 % Memory : 8046.5625MB
% 0.07/0.36 % OS : Linux 6.8.0-71-generic
% 0.07/0.36 % CPULimit : 300
% 0.07/0.36 % WCLimit : 300
% 0.07/0.36 % DateTime : Sun Sep 20 04:33:13 UTC 2026
% 0.07/0.36 % CPUTime :
% 32.63/32.91 % SZS status Unsatisfiable for theBenchmark
% 32.63/32.91 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------