TSTP Solution File: SYN744-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN744-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 10:10:26 EDT 2024
% Result : Satisfiable 0.20s 0.50s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_31)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_37,negated_conjecture,
( ssPv4(X3)
| ssPv2(X4)
| ~ ssRr(X1,X2)
| ~ ssPv8(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4)
| ~ ssPv8(X1) ),
c_0_31,
[final] ).
cnf(c_0_38,negated_conjecture,
ssRr(X1,skf1(X1)),
clause1,
[final] ).
cnf(c_0_39,negated_conjecture,
( ssPv4(X3)
| ssPv2(X4)
| ~ ssRr(X1,X2)
| ~ ssPv7(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4)
| ~ ssPv1(X1) ),
c_0_32,
[final] ).
cnf(c_0_40,negated_conjecture,
( ssPv7(X3)
| ssPv6(X4)
| ssPv4(X1)
| ~ ssRr(X1,X2)
| ~ ssPv8(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4) ),
c_0_33,
[final] ).
cnf(c_0_41,negated_conjecture,
( ssPv3(X3)
| ssPv1(X4)
| ~ ssRr(X1,X2)
| ~ ssPv7(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4)
| ~ ssPv4(X1) ),
c_0_34,
[final] ).
cnf(c_0_42,negated_conjecture,
( ssPv8(X2)
| ssPv4(X3)
| ssPv3(X4)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4)
| ~ ssPv7(X1) ),
c_0_35,
[final] ).
cnf(c_0_50,negated_conjecture,
( ssPv4(X2)
| ssPv1(X3)
| ssPv4(X1)
| ssPv6(X1)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
c_0_36,
[final] ).
cnf(c_0_56,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(X2)
| ~ ssPv8(X3)
| ~ ssPv8(X1)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]),
[final] ).
cnf(c_0_57,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(X2)
| ~ ssPv1(X1)
| ~ ssPv7(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_38]),
[final] ).
cnf(c_0_58,negated_conjecture,
( ssPv4(X1)
| ssPv6(skf1(X1))
| ssPv7(X2)
| ~ ssPv8(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_38]),
[final] ).
cnf(c_0_59,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv3(X2)
| ~ ssPv4(X1)
| ~ ssPv7(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_38]),
[final] ).
cnf(c_0_60,negated_conjecture,
( ssPv4(X1)
| ssPv8(X2)
| ssPv3(skf1(X3))
| ~ ssPv7(X3)
| ~ ssRr(X3,X1)
| ~ ssRr(X3,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_38]),
[final] ).
cnf(c_0_61,negated_conjecture,
( ssPv2(X4)
| ssPv1(X1)
| ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssRr(X1,X4) ),
c_0_43,
[final] ).
cnf(c_0_62,negated_conjecture,
( ssPv1(X4)
| ssPv4(X1)
| ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ~ ssRr(X1,X3)
| ~ ssPv2(X3)
| ~ ssRr(X1,X4) ),
c_0_44,
[final] ).
cnf(c_0_63,negated_conjecture,
( ssPv1(X4)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3)
| ~ ssPv2(X3)
| ~ ssRr(X1,X4)
| ~ ssPv3(X1) ),
c_0_45,
[final] ).
cnf(c_0_66,negated_conjecture,
( ssPv2(X4)
| ~ ssRr(X1,X2)
| ~ ssPv7(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssRr(X1,X4)
| ~ ssPv8(X1) ),
c_0_46,
[final] ).
cnf(c_0_67,negated_conjecture,
( ssPv6(X2)
| ssPv4(X3)
| ssPv6(X1)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv7(X1) ),
c_0_47,
[final] ).
cnf(c_0_68,negated_conjecture,
( ssPv5(X4)
| ~ ssRr(X1,X2)
| ~ ssPv5(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssRr(X1,X4)
| ~ ssPv5(X1) ),
c_0_48,
[final] ).
cnf(c_0_69,negated_conjecture,
( ssPv2(X1)
| ~ ssRr(X1,X2)
| ~ ssPv2(X2)
| ~ ssPv4(X1)
| ~ ssPv7(X1) ),
c_0_49,
[final] ).
cnf(c_0_70,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv4(X1)
| ssPv4(X2)
| ssPv6(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_38]),
[final] ).
cnf(c_0_71,negated_conjecture,
( ssPv8(X2)
| ssPv1(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X1)
| ~ ssPv4(X1) ),
c_0_51,
[final] ).
cnf(c_0_72,negated_conjecture,
( ssPv1(X3)
| ssPv3(X1)
| ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ~ ssRr(X1,X3)
| ~ ssPv4(X1) ),
c_0_52,
[final] ).
cnf(c_0_73,negated_conjecture,
( ssPv3(X3)
| ssPv2(X1)
| ~ ssRr(X1,X2)
| ~ ssPv8(X2)
| ~ ssRr(X1,X3)
| ~ ssPv8(X1) ),
c_0_53,
[final] ).
cnf(c_0_75,negated_conjecture,
( ssPv2(X3)
| ssPv5(X1)
| ~ ssRr(X1,X2)
| ~ ssPv8(X2)
| ~ ssRr(X1,X3)
| ~ ssPv6(X1) ),
c_0_54,
[final] ).
cnf(c_0_76,negated_conjecture,
( ssPv2(X3)
| ~ ssRr(X1,X2)
| ~ ssPv6(X2)
| ~ ssRr(X1,X3)
| ~ ssPv2(X1)
| ~ ssPv6(X1) ),
c_0_55,
[final] ).
cnf(c_0_86,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(skf1(X1))
| ~ ssPv8(X2)
| ~ ssPv8(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_38]),
[final] ).
cnf(c_0_87,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(skf1(X1))
| ~ ssPv1(X1)
| ~ ssPv7(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_38]),
[final] ).
cnf(c_0_88,negated_conjecture,
( ssPv4(X1)
| ssPv6(skf1(X1))
| ssPv7(skf1(X1))
| ~ ssPv8(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_38]),
[final] ).
cnf(c_0_89,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv7(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_38]),
[final] ).
cnf(c_0_90,negated_conjecture,
( ssPv4(skf1(X1))
| ssPv8(X2)
| ssPv3(skf1(X1))
| ~ ssPv7(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_38]),
[final] ).
cnf(c_0_91,negated_conjecture,
( ssPv1(X1)
| ssPv2(skf1(X1))
| ~ ssPv1(X2)
| ~ ssPv4(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_61,c_0_38]),
[final] ).
cnf(c_0_92,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv4(X1)
| ~ ssPv2(X2)
| ~ ssPv4(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_62,c_0_38]),
[final] ).
cnf(c_0_93,negated_conjecture,
( ssPv1(skf1(X1))
| ~ ssPv2(X2)
| ~ ssPv3(X3)
| ~ ssPv3(X1)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_63,c_0_38]),
[final] ).
cnf(c_0_94,negated_conjecture,
( ssPv1(X4)
| ~ ssRr(X1,X2)
| ~ ssPv5(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssRr(X1,X4)
| ~ ssPv4(X1) ),
c_0_64,
[final] ).
cnf(c_0_95,negated_conjecture,
( ssPv1(X4)
| ~ ssRr(X1,X2)
| ~ ssPv5(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssRr(X1,X4)
| ~ ssPv3(X1) ),
c_0_65,
[final] ).
cnf(c_0_96,negated_conjecture,
( ssPv2(skf1(X1))
| ~ ssPv1(X2)
| ~ ssPv8(X1)
| ~ ssPv7(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_66,c_0_38]),
[final] ).
cnf(c_0_97,negated_conjecture,
( ssPv4(X1)
| ssPv6(X2)
| ~ ssPv7(X2)
| ~ ssRr(X2,X1)
| ~ ssRr(X2,X2) ),
inference(ef,[status(thm)],[c_0_67]),
[final] ).
cnf(c_0_98,negated_conjecture,
( ssPv5(skf1(X1))
| ~ ssPv1(X2)
| ~ ssPv5(X3)
| ~ ssPv5(X1)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_68,c_0_38]),
[final] ).
cnf(c_0_99,negated_conjecture,
( ssPv2(X1)
| ~ ssPv2(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv7(X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_38]),
[final] ).
cnf(c_0_100,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv4(skf1(X1))
| ssPv4(X1)
| ssPv6(X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_38]),
[final] ).
cnf(c_0_101,negated_conjecture,
( ssPv4(skf1(X1))
| ssPv6(X1)
| ssPv6(X2)
| ~ ssPv7(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_38]),
[final] ).
cnf(c_0_102,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv8(X2)
| ~ ssPv1(X1)
| ~ ssPv4(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_38]),
[final] ).
cnf(c_0_103,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv3(X1)
| ~ ssPv4(X2)
| ~ ssPv4(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_72,c_0_38]),
[final] ).
cnf(c_0_104,negated_conjecture,
( ssPv2(X1)
| ssPv3(skf1(X1))
| ~ ssPv8(X2)
| ~ ssPv8(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_38]),
[final] ).
cnf(c_0_105,negated_conjecture,
( ssPv4(X1)
| ssPv8(X1)
| ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ~ ssRr(X1,X3)
| ~ ssPv3(X3) ),
c_0_74,
[final] ).
cnf(c_0_106,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv5(X1)
| ~ ssPv6(X1)
| ~ ssPv8(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_75,c_0_38]),
[final] ).
cnf(c_0_107,negated_conjecture,
( ssPv2(skf1(X1))
| ~ ssPv2(X1)
| ~ ssPv6(X2)
| ~ ssPv6(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_76,c_0_38]),
[final] ).
cnf(c_0_108,negated_conjecture,
( ssPv5(X3)
| ~ ssRr(X1,X2)
| ~ ssPv5(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X1)
| ~ ssPv5(X1) ),
c_0_77,
[final] ).
cnf(c_0_109,negated_conjecture,
( ssPv4(X1)
| ~ ssRr(X1,X2)
| ~ ssPv8(X2)
| ~ ssRr(X1,X3)
| ~ ssPv6(X3)
| ~ ssPv5(X1) ),
c_0_78,
[final] ).
cnf(c_0_110,negated_conjecture,
( ssPv6(X1)
| ~ ssRr(X1,X2)
| ~ ssPv6(X2)
| ~ ssRr(X1,X3)
| ~ ssPv4(X3)
| ~ ssPv4(X1) ),
c_0_79,
[final] ).
cnf(c_0_111,negated_conjecture,
( ssPv3(X1)
| ~ ssRr(X1,X2)
| ~ ssPv5(X2)
| ~ ssRr(X1,X3)
| ~ ssPv2(X3)
| ~ ssPv4(X1) ),
c_0_80,
[final] ).
cnf(c_0_112,negated_conjecture,
( ssPv5(X2)
| ssPv4(X1)
| ~ ssRr(X1,X2)
| ~ ssPv6(X1)
| ~ ssPv8(X1) ),
c_0_81,
[final] ).
cnf(c_0_113,negated_conjecture,
( ssPv1(X1)
| ssPv7(X1)
| ~ ssRr(X1,X2)
| ~ ssPv2(X2)
| ~ ssPv5(X1) ),
c_0_82,
[final] ).
cnf(c_0_114,negated_conjecture,
( ssPv6(X1)
| ssPv7(X1)
| ~ ssRr(X1,X2)
| ~ ssPv6(X2)
| ~ ssPv3(X1) ),
c_0_83,
[final] ).
cnf(c_0_115,negated_conjecture,
( ssPv7(X1)
| ssPv8(X1)
| ~ ssRr(X1,X2)
| ~ ssPv5(X2)
| ~ ssPv3(X1) ),
c_0_84,
[final] ).
cnf(c_0_116,negated_conjecture,
( ssPv1(X1)
| ssPv8(X1)
| ~ ssRr(X1,X2)
| ~ ssPv2(X2)
| ~ ssPv4(X1) ),
c_0_85,
[final] ).
cnf(c_0_117,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(skf1(X1))
| ~ ssPv8(skf1(X1))
| ~ ssPv8(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_38]),
[final] ).
cnf(c_0_118,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(skf1(X1))
| ~ ssPv1(X1)
| ~ ssPv7(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_87,c_0_38]),
[final] ).
cnf(c_0_119,negated_conjecture,
( ssPv4(X1)
| ssPv6(skf1(X1))
| ssPv7(skf1(X1))
| ~ ssPv8(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_88,c_0_38]),
[final] ).
cnf(c_0_120,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv7(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_89,c_0_38]),
[final] ).
cnf(c_0_121,negated_conjecture,
( ssPv4(skf1(X1))
| ssPv8(skf1(X1))
| ssPv3(skf1(X1))
| ~ ssPv7(X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_38]),
[final] ).
cnf(c_0_122,negated_conjecture,
( ssPv1(X1)
| ssPv2(skf1(X1))
| ~ ssPv1(skf1(X1))
| ~ ssPv4(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_91,c_0_38]),
[final] ).
cnf(c_0_123,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv4(X1)
| ~ ssPv2(skf1(X1))
| ~ ssPv4(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_92,c_0_38]),
[final] ).
cnf(c_0_124,negated_conjecture,
( ssPv1(skf1(X1))
| ~ ssPv2(skf1(X1))
| ~ ssPv3(X2)
| ~ ssPv3(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_93,c_0_38]),
[final] ).
cnf(c_0_125,negated_conjecture,
( ssPv1(skf1(X1))
| ~ ssPv1(X2)
| ~ ssPv4(X1)
| ~ ssPv5(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_94,c_0_38]),
[final] ).
cnf(c_0_126,negated_conjecture,
( ssPv1(skf1(X1))
| ~ ssPv1(X2)
| ~ ssPv3(X1)
| ~ ssPv5(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_95,c_0_38]),
[final] ).
cnf(c_0_127,negated_conjecture,
( ssPv2(skf1(X1))
| ~ ssPv1(skf1(X1))
| ~ ssPv8(X1)
| ~ ssPv7(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_96,c_0_38]),
[final] ).
cnf(c_0_128,negated_conjecture,
( ssPv4(skf1(X1))
| ssPv6(X1)
| ~ ssPv7(X1)
| ~ ssRr(X1,X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_38]),
[final] ).
cnf(c_0_129,negated_conjecture,
( ssPv1(X1)
| ssPv4(X2)
| ssPv6(X2)
| ~ ssRr(X2,X1)
| ~ ssRr(X2,X2) ),
inference(ef,[status(thm)],[c_0_50]),
[final] ).
cnf(c_0_130,negated_conjecture,
( ssPv5(skf1(X1))
| ~ ssPv1(skf1(X1))
| ~ ssPv5(X2)
| ~ ssPv5(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_98,c_0_38]),
[final] ).
cnf(c_0_131,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv2(skf1(X1))
| ssPv4(X1)
| ssPv6(X1)
| ~ ssPv2(skf1(skf1(X1)))
| ~ ssPv7(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]),
[final] ).
cnf(c_0_132,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv4(X1)
| ssPv6(X1)
| ~ ssRr(X1,X1) ),
inference(ef,[status(thm)],[c_0_70]),
[final] ).
cnf(c_0_133,negated_conjecture,
( ssPv4(skf1(X1))
| ssPv6(skf1(X1))
| ssPv6(X1)
| ~ ssPv7(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_38]),
[final] ).
cnf(c_0_134,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv8(skf1(X1))
| ~ ssPv1(X1)
| ~ ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_38]),
[final] ).
cnf(c_0_135,negated_conjecture,
( ssPv1(skf1(X1))
| ssPv3(X1)
| ~ ssPv4(skf1(X1))
| ~ ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_103,c_0_38]),
[final] ).
cnf(c_0_136,negated_conjecture,
( ssPv2(X1)
| ssPv3(skf1(X1))
| ~ ssPv8(skf1(X1))
| ~ ssPv8(X1) ),
inference(spm,[status(thm)],[c_0_104,c_0_38]),
[final] ).
cnf(c_0_137,negated_conjecture,
( ssPv4(X1)
| ssPv8(X1)
| ~ ssPv4(X2)
| ~ ssPv3(skf1(X1))
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_105,c_0_38]),
[final] ).
cnf(c_0_138,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv5(X1)
| ~ ssPv6(X1)
| ~ ssPv8(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_38]),
[final] ).
cnf(c_0_139,negated_conjecture,
( ssPv2(skf1(X1))
| ~ ssPv2(X1)
| ~ ssPv6(skf1(X1))
| ~ ssPv6(X1) ),
inference(spm,[status(thm)],[c_0_107,c_0_38]),
[final] ).
cnf(c_0_140,negated_conjecture,
( ssPv5(skf1(X1))
| ~ ssPv1(X1)
| ~ ssPv5(X2)
| ~ ssPv5(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_108,c_0_38]),
[final] ).
cnf(c_0_141,negated_conjecture,
( ssPv4(X1)
| ~ ssPv6(skf1(X1))
| ~ ssPv8(X2)
| ~ ssPv5(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_109,c_0_38]),
[final] ).
cnf(c_0_142,negated_conjecture,
( ssPv6(X1)
| ~ ssPv4(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv6(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_110,c_0_38]),
[final] ).
cnf(c_0_143,negated_conjecture,
( ssPv3(X1)
| ~ ssPv2(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv5(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_111,c_0_38]),
[final] ).
cnf(c_0_144,negated_conjecture,
( ssPv4(X1)
| ssPv5(skf1(X1))
| ~ ssPv6(X1)
| ~ ssPv8(X1) ),
inference(spm,[status(thm)],[c_0_112,c_0_38]),
[final] ).
cnf(c_0_145,negated_conjecture,
( ssPv1(X1)
| ssPv7(X1)
| ~ ssPv2(skf1(X1))
| ~ ssPv5(X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_38]),
[final] ).
cnf(c_0_146,negated_conjecture,
( ssPv6(X1)
| ssPv7(X1)
| ~ ssPv6(skf1(X1))
| ~ ssPv3(X1) ),
inference(spm,[status(thm)],[c_0_114,c_0_38]),
[final] ).
cnf(c_0_147,negated_conjecture,
( ssPv8(X1)
| ssPv7(X1)
| ~ ssPv3(X1)
| ~ ssPv5(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_115,c_0_38]),
[final] ).
cnf(c_0_148,negated_conjecture,
( ssPv1(X1)
| ssPv8(X1)
| ~ ssPv2(skf1(X1))
| ~ ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_116,c_0_38]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN744-1 : TPTP v8.1.2. Released v2.5.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 10:52:56 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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/tmp/tmp.YlA8e5RMQ3/E---3.1_21043.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21122 completed with status 1
% 0.20/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGUNF-FFMF11-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 21127 completed with status 1
% 0.20/0.50 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGUNF-FFMF11-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # No proof found!
% 0.20/0.50 # SZS status Satisfiable
% 0.20/0.50 # SZS output start Saturation
% See solution above
% 0.20/0.50 # Parsed axioms : 31
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 31
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 31
% 0.20/0.50 # Processed clauses : 123
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 4
% 0.20/0.50 # ...remaining for further processing : 119
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 66
% 0.20/0.50 # ...of the previous two non-redundant : 61
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 60
% 0.20/0.50 # Factorizations : 6
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 0
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 88
% 0.20/0.50 # Positive orientable unit clauses : 1
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 87
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 31
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 275
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 23
% 0.20/0.50 # Non-unit clause-clause subsumptions : 4
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 4694
% 0.20/0.50 # Search garbage collected termcells : 155
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.011 s
% 0.20/0.50 # Maximum resident set size: 1692 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.042 s
% 0.20/0.50 # System time : 0.008 s
% 0.20/0.50 # Total time : 0.050 s
% 0.20/0.50 # Maximum resident set size: 1752 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------