%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN735-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 03:26:11 PM UTC 2026
% Result : Satisfiable 0.10s 0.44s
% Output : Saturation 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_24ERROR: Could not build tree for root c_0_59ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_27,negated_conjecture,
( ~ ssPv3(X1)
| ~ ssRr(X1,X4)
| ~ ssRr(X1,X3)
| ~ ssPv4(X2)
| ~ ssRr(X1,X2)
| ssPv1(X4)
| ssPv3(X3) ),
c_0_21,
[final] ).
cnf(c_0_28,negated_conjecture,
ssRr(X1,skf1(X1)),
clause1,
[final] ).
cnf(c_0_29,negated_conjecture,
( ~ ssRr(X1,X3)
| ~ ssPv4(X2)
| ~ ssRr(X1,X2)
| ssPv3(X1)
| ssPv2(X1)
| ssPv2(X3) ),
c_0_22,
[final] ).
cnf(c_0_30,negated_conjecture,
( ~ ssPv1(X1)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ssPv2(X1)
| ssPv2(X3)
| ssPv4(X2) ),
c_0_23,
[final] ).
cnf(c_0_31,negated_conjecture,
( ~ ssRr(X1,X4)
| ~ ssPv1(X3)
| ~ ssRr(X1,X3)
| ~ ssPv4(X2)
| ~ ssRr(X1,X2)
| ssPv1(X1)
| ssPv2(X4) ),
c_0_24,
[final] ).
cnf(c_0_32,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssRr(X1,X3)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv2(X1)
| ssPv1(X3) ),
c_0_25,
[final] ).
cnf(c_0_33,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssRr(X1,X4)
| ~ ssRr(X1,X3)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv2(X4)
| ssPv4(X3) ),
c_0_26,
[final] ).
cnf(c_0_37,negated_conjecture,
( ~ ssRr(X2,X3)
| ~ ssRr(X2,X1)
| ~ ssPv3(X2)
| ~ ssPv4(X3)
| ssPv1(skf1(X2))
| ssPv3(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[final] ).
cnf(c_0_38,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ssPv3(X1)
| ssPv2(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]),
[final] ).
cnf(c_0_39,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv1(X1)
| ssPv4(X2)
| ssPv2(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_28]),
[final] ).
cnf(c_0_42,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssPv4(X2)
| ssPv1(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_28]),
[final] ).
cnf(c_0_43,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssPv4(X1)
| ssPv1(skf1(X1))
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_28]),
[final] ).
cnf(c_0_44,negated_conjecture,
( ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ~ ssPv3(X3)
| ~ ssPv4(X1)
| ssPv4(X2)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_28]),
[final] ).
cnf(c_0_47,negated_conjecture,
( ~ ssPv2(X1)
| ~ ssRr(X1,X4)
| ~ ssRr(X1,X3)
| ~ ssPv1(X2)
| ~ ssRr(X1,X2)
| ssPv2(X4)
| ssPv3(X3) ),
c_0_34,
[final] ).
cnf(c_0_48,negated_conjecture,
( ~ ssPv2(X1)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ssPv1(X1)
| ssPv3(X3)
| ssPv4(X2) ),
c_0_35,
[final] ).
cnf(c_0_51,negated_conjecture,
( ~ ssPv3(X1)
| ~ ssRr(X1,X3)
| ~ ssPv1(X2)
| ~ ssRr(X1,X2)
| ssPv2(X1)
| ssPv3(X3) ),
c_0_36,
[final] ).
cnf(c_0_52,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X1)
| ~ ssPv4(X2)
| ssPv1(skf1(X1))
| ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_28]),
[final] ).
cnf(c_0_53,negated_conjecture,
( ~ ssPv4(skf1(X1))
| ssPv3(X1)
| ssPv2(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_28]),
[final] ).
cnf(c_0_54,negated_conjecture,
( ~ ssPv1(X1)
| ssPv4(skf1(X1))
| ssPv2(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_39,c_0_28]),
[final] ).
cnf(c_0_55,negated_conjecture,
( ~ ssRr(X1,X4)
| ~ ssRr(X1,X3)
| ~ ssPv2(X2)
| ~ ssRr(X1,X2)
| ssPv2(X1)
| ssPv3(X4)
| ssPv4(X3) ),
c_0_40,
[final] ).
cnf(c_0_58,negated_conjecture,
( ~ ssPv1(X1)
| ~ ssRr(X1,X4)
| ~ ssPv1(X3)
| ~ ssRr(X1,X3)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv2(X4) ),
c_0_41,
[final] ).
cnf(c_0_59,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv1(skf1(X1))
| ~ ssPv4(X2)
| ssPv1(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_28]),
[final] ).
cnf(c_0_60,negated_conjecture,
( ~ ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ssPv1(skf1(X1))
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_28]),
[final] ).
cnf(c_0_61,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssPv4(X1)
| ssPv4(skf1(X1))
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_28]),
[final] ).
cnf(c_0_62,negated_conjecture,
( ~ ssRr(X1,X4)
| ~ ssPv1(X3)
| ~ ssRr(X1,X3)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv3(X1)
| ssPv2(X4) ),
c_0_45,
[final] ).
cnf(c_0_63,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssPv1(X1)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ssPv3(X3)
| ssPv4(X2) ),
c_0_46,
[final] ).
cnf(c_0_64,negated_conjecture,
( ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ~ ssPv1(X3)
| ~ ssPv2(X1)
| ssPv3(X2)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_47,c_0_28]),
[final] ).
cnf(c_0_65,negated_conjecture,
( ~ ssRr(X2,X1)
| ~ ssPv2(X2)
| ssPv1(X2)
| ssPv3(skf1(X2))
| ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_28]),
[final] ).
cnf(c_0_66,negated_conjecture,
( ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ssPv3(X1)
| ssPv1(X1)
| ssPv2(X3)
| ssPv3(X2) ),
c_0_49,
[final] ).
cnf(c_0_67,negated_conjecture,
( ~ ssRr(X1,X4)
| ~ ssPv2(X3)
| ~ ssRr(X1,X3)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv2(X1)
| ssPv3(X4) ),
c_0_50,
[final] ).
cnf(c_0_68,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv1(X2)
| ~ ssPv3(X1)
| ssPv3(skf1(X1))
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_28]),
[final] ).
cnf(c_0_69,negated_conjecture,
( ~ ssPv3(X1)
| ~ ssPv4(skf1(X1))
| ssPv1(skf1(X1))
| ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_52,c_0_28]),
[final] ).
cnf(c_0_70,negated_conjecture,
( ~ ssPv1(X1)
| ssPv3(X1)
| ssPv2(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]),
[final] ).
cnf(c_0_71,negated_conjecture,
( ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ~ ssPv2(X3)
| ssPv3(skf1(X1))
| ssPv4(X2)
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_28]),
[final] ).
cnf(c_0_72,negated_conjecture,
( ~ ssPv1(X3)
| ~ ssRr(X1,X3)
| ~ ssPv4(X2)
| ~ ssRr(X1,X2)
| ssPv3(X1)
| ssPv2(X1) ),
c_0_56,
[final] ).
cnf(c_0_73,negated_conjecture,
( ~ ssRr(X1,X2)
| ssPv4(X1)
| ssPv3(X1)
| ssPv1(X1)
| ssPv1(X2) ),
c_0_57,
[final] ).
cnf(c_0_74,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X1)
| ~ ssPv1(X3)
| ~ ssPv3(X2)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_28]),
[final] ).
cnf(c_0_76,negated_conjecture,
( ~ ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ssPv4(skf1(X1))
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_61,c_0_28]),
[final] ).
cnf(c_0_77,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssPv3(X2)
| ssPv3(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_28]),
[final] ).
cnf(c_0_78,negated_conjecture,
( ~ ssRr(X2,X1)
| ~ ssPv1(X2)
| ~ ssPv4(X2)
| ssPv3(skf1(X2))
| ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_28]),
[final] ).
cnf(c_0_79,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv1(X2)
| ~ ssPv2(X1)
| ssPv3(skf1(X1))
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_64,c_0_28]),
[final] ).
cnf(c_0_80,negated_conjecture,
( ~ ssPv2(X1)
| ssPv1(X1)
| ssPv3(skf1(X1))
| ssPv4(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_65,c_0_28]),
[final] ).
cnf(c_0_81,negated_conjecture,
( ~ ssRr(X1,X2)
| ssPv1(X1)
| ssPv3(X1)
| ssPv3(X2)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_66,c_0_28]),
[final] ).
cnf(c_0_82,negated_conjecture,
( ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ~ ssPv3(X3)
| ~ ssPv2(X2)
| ssPv3(skf1(X1))
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_67,c_0_28]),
[final] ).
cnf(c_0_83,negated_conjecture,
( ~ ssPv1(skf1(X1))
| ~ ssPv3(X1)
| ssPv3(skf1(X1))
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_28]),
[final] ).
cnf(c_0_85,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv2(X2)
| ssPv3(skf1(X1))
| ssPv4(skf1(X1))
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_28]),
[final] ).
cnf(c_0_86,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv1(skf1(X1))
| ~ ssPv4(X2)
| ssPv3(X1)
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_28]),
[final] ).
cnf(c_0_87,negated_conjecture,
( ssPv1(X1)
| ssPv1(skf1(X1))
| ssPv3(X1)
| ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_28]),
[final] ).
cnf(c_0_90,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv1(X1)
| ~ ssPv1(skf1(X1))
| ~ ssPv3(X2)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_74,c_0_28]),
[final] ).
cnf(c_0_92,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv1(skf1(X1))
| ~ ssPv3(X2)
| ssPv3(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_77,c_0_28]),
[final] ).
cnf(c_0_93,negated_conjecture,
( ~ ssPv1(X1)
| ~ ssPv4(X1)
| ssPv3(skf1(X1))
| ssPv4(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_28]),
[final] ).
cnf(c_0_94,negated_conjecture,
( ~ ssPv1(skf1(X1))
| ~ ssPv2(X1)
| ssPv3(skf1(X1))
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_79,c_0_28]),
[final] ).
cnf(c_0_95,negated_conjecture,
( ~ ssPv3(X1)
| ~ ssPv2(X1)
| ssPv1(X1)
| ssPv1(skf1(X1))
| ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_69,c_0_80]),
[final] ).
cnf(c_0_96,negated_conjecture,
( ssPv1(X1)
| ssPv3(X1)
| ssPv3(skf1(X1))
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_81,c_0_28]),
[final] ).
cnf(c_0_97,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssPv2(skf1(X1))
| ssPv3(skf1(X1))
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_28]),
[final] ).
cnf(c_0_98,negated_conjecture,
( ~ ssPv1(X1)
| ssPv3(skf1(X1))
| ssPv2(X1)
| ssPv2(skf1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_70]),
[final] ).
cnf(c_0_99,negated_conjecture,
( ~ ssPv2(skf1(X1))
| ssPv3(skf1(X1))
| ssPv4(skf1(X1))
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_85,c_0_28]),
[final] ).
cnf(c_0_100,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ssPv1(X1)
| ssPv3(X1)
| ssPv4(X1)
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]),
[final] ).
cnf(c_0_102,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssPv1(X1)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X2)
| ssPv2(X3)
| ssPv4(X2) ),
c_0_88,
[final] ).
cnf(c_0_103,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssPv2(X1)
| ~ ssPv2(X2)
| ~ ssRr(X1,X2)
| ssPv3(X1) ),
c_0_89,
[final] ).
cnf(c_0_106,negated_conjecture,
( ~ ssPv1(X1)
| ~ ssPv3(X1)
| ~ ssPv4(X1)
| ssPv1(skf1(X1))
| ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_69,c_0_93]),
[final] ).
cnf(c_0_107,negated_conjecture,
( ~ ssPv2(X1)
| ssPv1(X1)
| ssPv3(skf1(X1))
| ssPv2(skf1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]),
[final] ).
cnf(c_0_108,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv1(X1)
| ~ ssPv3(X2)
| ssPv3(skf1(X1))
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]),
[final] ).
cnf(c_0_109,negated_conjecture,
( ~ ssPv3(X1)
| ~ ssPv2(skf1(X1))
| ssPv3(skf1(X1))
| ssPv2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_99]),c_0_83]),
[final] ).
cnf(c_0_110,negated_conjecture,
( ~ ssPv4(skf1(X1))
| ssPv1(X1)
| ssPv3(X1)
| ssPv4(X1)
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_100,c_0_28]),
[final] ).
cnf(c_0_111,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssPv1(X1)
| ~ ssRr(X1,X3)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2)
| ssPv3(X3) ),
c_0_101,
[final] ).
cnf(c_0_112,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv1(X1)
| ~ ssPv4(X1)
| ssPv4(X2)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_102,c_0_28]),
[final] ).
cnf(c_0_113,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssPv2(X1)
| ~ ssPv2(skf1(X1))
| ssPv3(X1) ),
inference(spm,[status(thm)],[c_0_103,c_0_28]),
[final] ).
cnf(c_0_114,negated_conjecture,
( ~ ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ssPv2(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_104,c_0_28]),
[final] ).
cnf(c_0_115,negated_conjecture,
( ssPv1(X1)
| ssPv3(X1)
| ssPv4(X1)
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_105,c_0_28]),
[final] ).
cnf(c_0_116,negated_conjecture,
( ~ ssPv3(X1)
| ~ ssPv4(X1)
| ~ ssPv2(X1)
| ssPv3(skf1(X1))
| ssPv2(skf1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_106]),c_0_107]),
[final] ).
cnf(c_0_117,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ssPv3(X1)
| ssPv3(skf1(X1))
| ssPv2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_96]),c_0_108]),
[final] ).
cnf(c_0_118,negated_conjecture,
( ~ ssPv1(X1)
| ~ ssPv3(X1)
| ssPv3(skf1(X1))
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_109,c_0_98]),
[final] ).
cnf(c_0_119,negated_conjecture,
( ssPv1(X1)
| ssPv3(X1)
| ssPv3(skf1(X1))
| ssPv4(X1)
| ssPv2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_99]),c_0_96]),
[final] ).
cnf(c_0_120,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv4(X2)
| ssPv3(X1)
| ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_60]),
[final] ).
cnf(c_0_121,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv1(X1)
| ~ ssPv3(X2)
| ~ ssPv4(X1)
| ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_111,c_0_28]),
[final] ).
cnf(c_0_122,negated_conjecture,
( ~ ssPv1(X1)
| ~ ssPv4(X1)
| ssPv4(skf1(X1))
| ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_112,c_0_28]),
[final] ).
cnf(c_0_123,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssPv2(X1)
| ssPv1(X1)
| ssPv3(X1)
| ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_113,c_0_96]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN735-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 11:14:12 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % new_bool_3 with pid 1761057 completed with status 1
% 0.10/0.44 % Result found by new_bool_3
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGUNF-FFMF11-SFFFFFNN
% 0.10/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 1761060 completed with status 1
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGUNF-FFMF11-SFFFFFNN
% 0.10/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44
% 0.10/0.44 % No proof found!
% 0.10/0.44 % SZS status Satisfiable
% 0.10/0.44 % SZS output start Saturation
% See solution above
% 0.10/0.44 % Parsed axioms : 21
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 21
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 21
% 0.10/0.44 % Processed clauses : 98
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 11
% 0.10/0.44 % ...remaining for further processing : 87
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 9
% 0.10/0.44 % Backward-rewritten : 0
% 0.10/0.44 % Generated clauses : 128
% 0.10/0.44 % ...of the previous two non-redundant : 78
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 10
% 0.10/0.44 % Paramodulations : 128
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 0
% 0.10/0.44 % ...of those cached : 0
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 78
% 0.10/0.44 % Positive orientable unit clauses : 1
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 0
% 0.10/0.44 % Non-unit-clauses : 77
% 0.10/0.44 % Current number of unprocessed clauses: 0
% 0.10/0.44 % ...number of literals in the above : 0
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 9
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 178
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 72
% 0.10/0.44 % Non-unit clause-clause subsumptions : 30
% 0.10/0.44 % Unit Clause-clause subsumption calls : 0
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 0
% 0.10/0.44 % BW rewrite match successes : 0
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 4693
% 0.10/0.44 % Search garbage collected termcells : 98
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.010 s
% 0.10/0.44 % System time : 0.001 s
% 0.10/0.44 % Total time : 0.011 s
% 0.10/0.44 % Maximum resident set size: 3648 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.012 s
% 0.10/0.44 % System time : 0.006 s
% 0.10/0.44 % Total time : 0.018 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------