%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP035-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 01:34:25 PM UTC 2026
% Result : Satisfiable 0.15s 0.45s
% Output : Saturation 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_46ERROR: Could not build tree for root c_0_112ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_51,negated_conjecture,
( ~ table(X1,X5)
| ~ ssSkP0(skf27(X1,X4),X5,X2,X1)
| ~ guy(X1,skf28(X1,X3))
| ~ young(X1,skf28(X1,X3))
| ~ group(X1,X2)
| ~ three(X1,X2)
| ssSkP2(X6,X1) ),
c_0_46,
[final] ).
cnf(c_0_52,negated_conjecture,
( member(X4,skf18(X3,X4,X5,X6),X3)
| ssSkP0(X1,X2,X3,X4) ),
clause13,
[final] ).
cnf(c_0_53,negated_conjecture,
( ~ table(X1,X4)
| ~ ssSkP0(skf27(X1,X3),X4,X2,X1)
| ~ group(X1,X2)
| ~ three(X1,X2)
| member(X1,skf28(X1,X2),X2)
| ssSkP2(X5,X1) ),
c_0_47,
[final] ).
cnf(c_0_54,negated_conjecture,
( ~ table(X1,X3)
| ~ ssSkP1(X3,skf34(X1,X4),X2,X1)
| ~ group(X1,X2)
| member(X1,skf35(X1,X2),X2)
| ssSkP3(X5,X1) ),
c_0_48,
[final] ).
cnf(c_0_55,negated_conjecture,
( member(X4,skf21(X3,X4,X5,X6),X3)
| ssSkP1(X1,X2,X3,X4) ),
clause14,
[final] ).
cnf(c_0_60,negated_conjecture,
( ~ table(X1,X4)
| ~ ssSkP1(X4,skf34(X1,X5),X2,X1)
| ~ hamburger(X1,skf35(X1,X3))
| ~ group(X1,X2)
| ssSkP3(X6,X1) ),
c_0_49,
[final] ).
cnf(c_0_70,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkP3(X2,X1)
| ~ three(X1,X2)
| ~ group(X1,X2)
| member(X1,skf37(X1,X2),X2)
| ssSkC0 ),
c_0_50,
[final] ).
cnf(c_0_71,negated_conjecture,
( group(skc64,skc65)
| ssSkC0 ),
clause3,
[final] ).
cnf(c_0_72,negated_conjecture,
actual_world(skc64),
clause1,
[final] ).
cnf(c_0_73,negated_conjecture,
( ~ group(X1,X2)
| ~ three(X1,X2)
| ~ guy(X1,skf28(X1,X7))
| ~ young(X1,skf28(X1,X7))
| ~ table(X1,X6)
| ssSkP2(X5,X1)
| member(X1,skf18(X2,X1,X3,X4),X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]),
[final] ).
cnf(c_0_74,negated_conjecture,
( ~ group(X1,X2)
| ~ three(X1,X2)
| ~ table(X1,X6)
| ssSkP2(X5,X1)
| member(X1,skf28(X1,X2),X2)
| member(X1,skf18(X2,X1,X3,X4),X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_52]),
[final] ).
cnf(c_0_75,negated_conjecture,
( ~ group(X1,X2)
| ~ table(X1,X6)
| ssSkP3(X5,X1)
| member(X1,skf35(X1,X2),X2)
| member(X1,skf21(X2,X1,X3,X4),X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]),
[final] ).
cnf(c_0_76,negated_conjecture,
( ~ ssSkP1(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| with(X1,skf19(X1,X2,X6,X7),X2) ),
c_0_56,
[final] ).
cnf(c_0_77,negated_conjecture,
( ~ ssSkP0(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| with(X1,skf16(X1,X2,X4,X6),X4) ),
c_0_57,
[final] ).
cnf(c_0_78,negated_conjecture,
( ~ ssSkP1(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| at(X1,skf19(X1,X2,X4,X6),X4) ),
c_0_58,
[final] ).
cnf(c_0_79,negated_conjecture,
( ~ ssSkP0(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| at(X1,skf16(X1,X2,X4,X5),X5) ),
c_0_59,
[final] ).
cnf(c_0_80,negated_conjecture,
( ~ group(X1,X2)
| ~ hamburger(X1,skf35(X1,X7))
| ~ table(X1,X6)
| ssSkP3(X5,X1)
| member(X1,skf21(X2,X1,X3,X4),X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_55]),
[final] ).
cnf(c_0_81,negated_conjecture,
( ~ ssSkP1(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| agent(X1,skf19(X1,X2,X4,X5),X5) ),
c_0_61,
[final] ).
cnf(c_0_82,negated_conjecture,
( ~ ssSkP0(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| agent(X1,skf16(X1,X2,X6,X7),X2) ),
c_0_62,
[final] ).
cnf(c_0_83,negated_conjecture,
( ~ ssSkP1(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| sit(X1,skf19(X1,X6,X7,X8)) ),
c_0_63,
[final] ).
cnf(c_0_84,negated_conjecture,
( ~ ssSkP0(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| sit(X1,skf16(X1,X6,X7,X8)) ),
c_0_64,
[final] ).
cnf(c_0_85,negated_conjecture,
( ~ ssSkP1(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| present(X1,skf19(X1,X6,X7,X8)) ),
c_0_65,
[final] ).
cnf(c_0_86,negated_conjecture,
( ~ ssSkP0(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| present(X1,skf16(X1,X6,X7,X8)) ),
c_0_66,
[final] ).
cnf(c_0_87,negated_conjecture,
( ~ ssSkP1(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| event(X1,skf19(X1,X6,X7,X8)) ),
c_0_67,
[final] ).
cnf(c_0_88,negated_conjecture,
( ~ ssSkP0(X4,X5,X3,X1)
| ~ member(X1,X2,X3)
| event(X1,skf16(X1,X6,X7,X8)) ),
c_0_68,
[final] ).
cnf(c_0_89,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkP3(X3,X1)
| ~ three(X1,X3)
| ~ group(X1,X3)
| ~ guy(X1,skf37(X1,X2))
| ~ young(X1,skf37(X1,X2))
| ssSkC0 ),
c_0_69,
[final] ).
cnf(c_0_90,negated_conjecture,
( ~ three(skc64,skc65)
| ~ ssSkP3(skc65,skc64)
| ssSkC0
| member(skc64,skf37(skc64,skc65),skc65) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72])]),
[final] ).
cnf(c_0_91,negated_conjecture,
( member(X2,skf34(X2,X1),X1)
| ssSkP3(X1,X2) ),
clause9,
[final] ).
cnf(c_0_112,negated_conjecture,
( ~ three(skc64,skc65)
| ~ guy(skc64,skf28(skc64,X5))
| ~ young(skc64,skf28(skc64,X5))
| ~ table(skc64,X4)
| ssSkC0
| ssSkP2(X3,skc64)
| member(skc64,skf18(skc65,skc64,X1,X2),skc65) ),
inference(spm,[status(thm)],[c_0_73,c_0_71]),
[final] ).
cnf(c_0_113,negated_conjecture,
( ~ three(skc64,skc65)
| ~ table(skc64,X4)
| ssSkC0
| ssSkP2(X3,skc64)
| member(skc64,skf28(skc64,skc65),skc65)
| member(skc64,skf18(skc65,skc64,X1,X2),skc65) ),
inference(spm,[status(thm)],[c_0_74,c_0_71]),
[final] ).
cnf(c_0_114,negated_conjecture,
( ~ table(skc64,X4)
| ssSkC0
| ssSkP3(X3,skc64)
| member(skc64,skf35(skc64,skc65),skc65)
| member(skc64,skf21(skc65,skc64,X1,X2),skc65) ),
inference(spm,[status(thm)],[c_0_75,c_0_71]),
[final] ).
cnf(c_0_115,negated_conjecture,
( ~ member(X1,X2,X5)
| member(X1,skf21(X5,X1,X6,X7),X5)
| with(X1,skf19(X1,X2,X3,X4),X2) ),
inference(spm,[status(thm)],[c_0_76,c_0_55]),
[final] ).
cnf(c_0_116,negated_conjecture,
( ~ member(X1,X2,X5)
| member(X1,skf18(X5,X1,X6,X7),X5)
| with(X1,skf16(X1,X2,X3,X4),X3) ),
inference(spm,[status(thm)],[c_0_77,c_0_52]),
[final] ).
cnf(c_0_117,negated_conjecture,
( ~ member(X1,X2,X5)
| member(X1,skf21(X5,X1,X6,X7),X5)
| at(X1,skf19(X1,X2,X3,X4),X3) ),
inference(spm,[status(thm)],[c_0_78,c_0_55]),
[final] ).
cnf(c_0_118,negated_conjecture,
( ~ member(X1,X2,X5)
| member(X1,skf18(X5,X1,X6,X7),X5)
| at(X1,skf16(X1,X2,X3,X4),X4) ),
inference(spm,[status(thm)],[c_0_79,c_0_52]),
[final] ).
cnf(c_0_119,negated_conjecture,
( ~ hamburger(skc64,skf35(skc64,X5))
| ~ table(skc64,X4)
| ssSkC0
| ssSkP3(X3,skc64)
| member(skc64,skf21(skc65,skc64,X1,X2),skc65) ),
inference(spm,[status(thm)],[c_0_80,c_0_71]),
[final] ).
cnf(c_0_120,negated_conjecture,
( ~ member(X1,X2,X5)
| member(X1,skf21(X5,X1,X6,X7),X5)
| agent(X1,skf19(X1,X2,X3,X4),X4) ),
inference(spm,[status(thm)],[c_0_81,c_0_55]),
[final] ).
cnf(c_0_121,negated_conjecture,
( ~ member(X1,X2,X5)
| member(X1,skf18(X5,X1,X6,X7),X5)
| agent(X1,skf16(X1,X2,X3,X4),X2) ),
inference(spm,[status(thm)],[c_0_82,c_0_52]),
[final] ).
cnf(c_0_122,negated_conjecture,
( ~ member(X1,X8,X5)
| member(X1,skf21(X5,X1,X6,X7),X5)
| sit(X1,skf19(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_83,c_0_55]),
[final] ).
cnf(c_0_123,negated_conjecture,
( ~ member(X1,X8,X5)
| member(X1,skf18(X5,X1,X6,X7),X5)
| sit(X1,skf16(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_84,c_0_52]),
[final] ).
cnf(c_0_124,negated_conjecture,
( ~ member(X1,X8,X5)
| member(X1,skf21(X5,X1,X6,X7),X5)
| present(X1,skf19(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_85,c_0_55]),
[final] ).
cnf(c_0_125,negated_conjecture,
( ~ member(X1,X8,X5)
| member(X1,skf18(X5,X1,X6,X7),X5)
| present(X1,skf16(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_86,c_0_52]),
[final] ).
cnf(c_0_126,negated_conjecture,
( ~ member(X1,X8,X5)
| member(X1,skf21(X5,X1,X6,X7),X5)
| event(X1,skf19(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_87,c_0_55]),
[final] ).
cnf(c_0_127,negated_conjecture,
( ~ member(X1,X8,X5)
| member(X1,skf18(X5,X1,X6,X7),X5)
| event(X1,skf16(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_88,c_0_52]),
[final] ).
cnf(c_0_128,negated_conjecture,
( ~ three(skc64,skc65)
| ~ ssSkP3(skc65,skc64)
| ~ guy(skc64,skf37(skc64,X1))
| ~ young(skc64,skf37(skc64,X1))
| ssSkC0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_71]),c_0_72])]),
[final] ).
cnf(c_0_129,negated_conjecture,
( ~ three(skc64,skc65)
| ssSkC0
| member(skc64,skf37(skc64,skc65),skc65)
| member(skc64,skf34(skc64,skc65),skc65) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]),
[final] ).
cnf(c_0_130,negated_conjecture,
( ~ event(X1,X2)
| ~ agent(X1,X2,X5)
| ~ present(X1,X2)
| ~ sit(X1,X2)
| ~ at(X1,X2,X4)
| ~ with(X1,X2,skf21(X3,X1,X4,X5))
| ssSkP1(X4,X5,X3,X1) ),
c_0_92,
[final] ).
cnf(c_0_131,negated_conjecture,
( ~ event(X1,X2)
| ~ agent(X1,X2,skf18(X5,X1,X3,X4))
| ~ present(X1,X2)
| ~ sit(X1,X2)
| ~ at(X1,X2,X4)
| ~ with(X1,X2,X3)
| ssSkP0(X3,X4,X5,X1) ),
c_0_93,
[final] ).
cnf(c_0_132,negated_conjecture,
( ~ ssSkP2(X3,X1)
| ~ member(X1,X2,X3)
| ssSkP0(X2,skf24(X1,X2),skf23(X1,X2),X1) ),
c_0_94,
[final] ).
cnf(c_0_133,negated_conjecture,
( ~ ssSkP2(X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,skf23(X1,X3))
| young(X1,X2) ),
c_0_95,
[final] ).
cnf(c_0_134,negated_conjecture,
( ~ ssSkP3(X3,X1)
| ~ member(X1,X2,X3)
| ssSkP1(skf31(X1,X2),X2,skf30(X1,X2),X1) ),
c_0_96,
[final] ).
cnf(c_0_135,negated_conjecture,
( ~ ssSkP2(X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,skf23(X1,X3))
| guy(X1,X2) ),
c_0_97,
[final] ).
cnf(c_0_136,negated_conjecture,
( ~ ssSkP3(X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,skf30(X1,X3))
| hamburger(X1,X2) ),
c_0_98,
[final] ).
cnf(c_0_137,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ ssSkP2(X3,X1)
| ~ group(X1,X3)
| ~ hamburger(X1,skf15(X1,X2)) ),
c_0_99,
[final] ).
cnf(c_0_138,negated_conjecture,
( ~ ssSkP3(X3,X1)
| ~ member(X1,X2,X3)
| table(X1,skf31(X1,X4)) ),
c_0_100,
[final] ).
cnf(c_0_139,negated_conjecture,
( ~ ssSkP2(X3,X1)
| ~ member(X1,X2,X3)
| table(X1,skf24(X1,X4)) ),
c_0_101,
[final] ).
cnf(c_0_140,negated_conjecture,
( ~ ssSkP2(X3,X1)
| ~ member(X1,X2,X3)
| three(X1,skf23(X1,X4)) ),
c_0_102,
[final] ).
cnf(c_0_141,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ ssSkP2(X2,X1)
| ~ group(X1,X2)
| member(X1,skf15(X1,X2),X2) ),
c_0_103,
[final] ).
cnf(c_0_142,negated_conjecture,
( ~ ssSkP3(X3,X1)
| ~ member(X1,X2,X3)
| group(X1,skf30(X1,X4)) ),
c_0_104,
[final] ).
cnf(c_0_143,negated_conjecture,
( ~ ssSkP2(X3,X1)
| ~ member(X1,X2,X3)
| group(X1,skf23(X1,X4)) ),
c_0_105,
[final] ).
cnf(c_0_144,negated_conjecture,
( member(X2,skf27(X2,X1),X1)
| ssSkP2(X1,X2) ),
clause8,
[final] ).
cnf(c_0_145,negated_conjecture,
( ~ ssSkC0
| ~ member(skc4,X1,skc5)
| young(skc4,X1) ),
c_0_106,
[final] ).
cnf(c_0_146,negated_conjecture,
( ~ ssSkC0
| ~ member(skc4,X1,skc5)
| guy(skc4,X1) ),
c_0_107,
[final] ).
cnf(c_0_147,negated_conjecture,
( ~ member(skc64,X1,skc65)
| hamburger(skc64,X1)
| ssSkC0 ),
c_0_108,
[final] ).
cnf(c_0_148,negated_conjecture,
( ~ ssSkC0
| ssSkP3(skc5,skc4) ),
c_0_109,
[final] ).
cnf(c_0_149,negated_conjecture,
( ~ ssSkC0
| three(skc4,skc5) ),
c_0_110,
[final] ).
cnf(c_0_150,negated_conjecture,
( ~ ssSkC0
| group(skc4,skc5) ),
c_0_111,
[final] ).
cnf(c_0_151,negated_conjecture,
( ssSkP2(skc65,skc64)
| ssSkC0 ),
clause4,
[final] ).
cnf(c_0_152,negated_conjecture,
actual_world(skc4),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP035-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n005.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 01:34:48 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2264400 completed with status 1
% 0.15/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGHNF-FFMS32-SFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.45 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/0.45 % Starting G-E--_107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 136s (1) cores
% 0.15/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45 % G-E--_107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 2264408 completed with status 1
% 0.15/0.45 % Result found by G-E--_107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.15/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGHNF-FFMS32-SFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.45 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/0.45 % Starting G-E--_107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 136s (1) cores
% 0.15/0.45 % Preprocessing time : 0.002 s
% 0.15/0.45 % Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 % No proof found!
% 0.15/0.45 % SZS status Satisfiable
% 0.15/0.45 % SZS output start Saturation
% See solution above
% 0.15/0.45 % Parsed axioms : 46
% 0.15/0.45 % Removed by relevancy pruning/SinE : 0
% 0.15/0.45 % Initial clauses : 46
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 46
% 0.15/0.45 % Processed clauses : 115
% 0.15/0.45 % ...of these trivial : 0
% 0.15/0.45 % ...subsumed : 0
% 0.15/0.45 % ...remaining for further processing : 115
% 0.15/0.45 % Other redundant clauses eliminated : 0
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 0
% 0.15/0.45 % Backward-rewritten : 0
% 0.15/0.45 % Generated clauses : 25
% 0.15/0.45 % ...of the previous two non-redundant : 23
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 0
% 0.15/0.45 % Paramodulations : 25
% 0.15/0.45 % Factorizations : 0
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 0
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 4
% 0.15/0.45 % ...of those cached : 3
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 69
% 0.15/0.45 % Positive orientable unit clauses : 2
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 0
% 0.15/0.45 % Non-unit-clauses : 67
% 0.15/0.45 % Current number of unprocessed clauses: 0
% 0.15/0.45 % ...number of literals in the above : 0
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 46
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 1234
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 486
% 0.15/0.45 % Non-unit clause-clause subsumptions : 0
% 0.15/0.45 % Unit Clause-clause subsumption calls : 0
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 0
% 0.15/0.45 % BW rewrite match successes : 0
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 3575
% 0.15/0.45 % Search garbage collected termcells : 180
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.011 s
% 0.15/0.45 % System time : 0.002 s
% 0.15/0.45 % Total time : 0.013 s
% 0.15/0.45 % Maximum resident set size: 3632 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.051 s
% 0.15/0.45 % System time : 0.013 s
% 0.15/0.45 % Total time : 0.064 s
% 0.15/0.45 % Maximum resident set size: 4864 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------