%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV267-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n012.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 : Fri Sep 25 03:12:41 PM UTC 2026
% Result : Unsatisfiable 3.65s 0.85s
% Output : Proof 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 19 unt; 0 def)
% Number of atoms : 31 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 14 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 25 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f3,axiom,
( c_lessequals(V_A,V_C,tc_set(T_a))
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| ~ c_lessequals(V_B,V_C,tc_set(T_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).
fof(f3_nnf,plain,
! [V_B,V_C,T_a,V_A] :
( c_lessequals(V_A,V_C,tc_set(T_a))
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| ~ c_lessequals(V_B,V_C,tc_set(T_a)) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [V_B,V_C,T_a,V_A] :
( c_lessequals(V_A,V_C,tc_set(T_a))
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| ~ c_lessequals(V_B,V_C,tc_set(T_a)) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(X3,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi2,axiom,
ifeq(c_lessequals(X0,X1,tc_set(X2)),true,ifeq(c_lessequals(X3,X0,tc_set(X2)),true,c_lessequals(X3,X1,tc_set(X2)),true),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(f0,negated_conjecture,
c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f0_nnf,plain,
c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(hi0,negated_conjecture,
c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(f2,axiom,
c_lessequals(V_H,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__increasing_0) ).
fof(f2_nnf,plain,
! [V_H] : c_lessequals(V_H,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [V_H] : c_lessequals(V_H,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
c_lessequals(X0,c_Message_Oparts(X0),tc_set(tc_Message_Omsg)),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi1,axiom,
c_lessequals(X0,c_Message_Oparts(X0),tc_set(tc_Message_Omsg)) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t2,plain,
c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) = true,
inference(hyper_resolution,[status(thm)],[hi2,hi0,hi1]) ).
cnf(t12,plain,
c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(f1,negated_conjecture,
~ c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f1_nnf,plain,
~ c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
~ c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
~ c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(goal_0,negated_conjecture,
c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) != true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t12]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV267-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Thu Sep 24 18:57:05 UTC 2026
% 0.02/0.29 % CPUTime :
% 0.02/0.29 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.65/0.85 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.65/0.85 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------