TSTP Solution File: KRS011-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS011-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 08:11:51 EDT 2024
% Result : Satisfiable 0.21s 0.56s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_57)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_58,plain,
( t(X1,X2)
| ~ t3(X1,X2) ),
c_0_51,
[final] ).
cnf(c_0_59,plain,
( t3(u11r4(X1),u11r5(X1))
| ~ f3(X1) ),
c_0_52,
[final] ).
cnf(c_0_61,plain,
( t(X1,X2)
| ~ t2(X1,X2) ),
c_0_53,
[final] ).
cnf(c_0_62,plain,
( t2(u10r4(X1),u10r5(X1))
| ~ f2(X1) ),
c_0_54,
[final] ).
cnf(c_0_64,plain,
( t(X1,X2)
| ~ t1(X1,X2) ),
c_0_55,
[final] ).
cnf(c_0_65,plain,
( t1(u9r4(X1),u9r5(X1))
| ~ f1(X1) ),
c_0_56,
[final] ).
cnf(c_0_72,plain,
( equalish(X1,X2)
| equalish(X1,X3)
| equalish(X2,X3)
| ~ f3(X4)
| ~ t(u11r4(X4),X1)
| ~ t(u11r4(X4),X2)
| ~ t(u11r4(X4),X3) ),
c_0_57,
[final] ).
cnf(c_0_73,plain,
( t(u11r4(X1),u11r5(X1))
| ~ f3(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]),
[final] ).
cnf(c_0_74,plain,
( equalish(X1,X2)
| equalish(X1,X3)
| equalish(X2,X3)
| ~ f2(X4)
| ~ t(u10r4(X4),X1)
| ~ t(u10r4(X4),X2)
| ~ t(u10r4(X4),X3) ),
c_0_60,
[final] ).
cnf(c_0_75,plain,
( t(u10r4(X1),u10r5(X1))
| ~ f2(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]),
[final] ).
cnf(c_0_76,plain,
( equalish(X1,X2)
| equalish(X1,X3)
| equalish(X2,X3)
| ~ f1(X4)
| ~ t(u9r4(X4),X1)
| ~ t(u9r4(X4),X2)
| ~ t(u9r4(X4),X3) ),
c_0_63,
[final] ).
cnf(c_0_77,plain,
( t(u9r4(X1),u9r5(X1))
| ~ f1(X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]),
[final] ).
cnf(c_0_79,plain,
( r(X1,X2)
| ~ r3(X1,X2) ),
c_0_66,
[final] ).
cnf(c_0_80,plain,
( r3(X1,u11r4(X1))
| ~ f3(X1) ),
c_0_67,
[final] ).
cnf(c_0_81,plain,
( r(X1,X2)
| ~ r2(X1,X2) ),
c_0_68,
[final] ).
cnf(c_0_82,plain,
( r2(X1,u10r4(X1))
| ~ f2(X1) ),
c_0_69,
[final] ).
cnf(c_0_83,plain,
( r(X1,X2)
| ~ r1(X1,X2) ),
c_0_70,
[final] ).
cnf(c_0_84,plain,
( r1(X1,u9r4(X1))
| ~ f1(X1) ),
c_0_71,
[final] ).
cnf(c_0_85,plain,
( equalish(X1,u11r5(X2))
| equalish(X3,u11r5(X2))
| equalish(X1,X3)
| ~ f3(X2)
| ~ t(u11r4(X2),X3)
| ~ t(u11r4(X2),X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]),
[final] ).
cnf(c_0_86,plain,
( equalish(X1,u10r5(X2))
| equalish(X3,u10r5(X2))
| equalish(X1,X3)
| ~ f2(X2)
| ~ t(u10r4(X2),X3)
| ~ t(u10r4(X2),X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]),
[final] ).
cnf(c_0_87,plain,
( equalish(X1,u9r5(X2))
| equalish(X3,u9r5(X2))
| equalish(X1,X3)
| ~ f1(X2)
| ~ t(u9r4(X2),X3)
| ~ t(u9r4(X2),X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]),
[final] ).
cnf(c_0_99,plain,
( r2least(X1)
| equalish(X2,X3)
| ~ r(X1,X2)
| ~ r(X1,X3) ),
c_0_78,
[final] ).
cnf(c_0_100,plain,
( r(X1,u11r4(X1))
| ~ f3(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]),
[final] ).
cnf(c_0_101,plain,
( r(X1,u10r4(X1))
| ~ f2(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]),
[final] ).
cnf(c_0_103,plain,
( r(X1,u9r4(X1))
| ~ f1(X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]),
[final] ).
cnf(c_0_115,plain,
( f3(X1)
| t(X2,u11r3(X2,X1))
| ~ r3(X1,X2)
| ~ t3(X2,X3)
| ~ e(X3) ),
c_0_88,
[final] ).
cnf(c_0_116,plain,
( e(u11r5(X1))
| ~ f3(X1) ),
c_0_89,
[final] ).
cnf(c_0_117,plain,
( f3(X1)
| t(X2,u11r1(X2,X1))
| ~ r3(X1,X2)
| ~ t3(X2,X3)
| ~ e(X3) ),
c_0_90,
[final] ).
cnf(c_0_118,plain,
( f3(X1)
| t(X2,u11r2(X2,X1))
| ~ r3(X1,X2)
| ~ t3(X2,X3)
| ~ e(X3) ),
c_0_91,
[final] ).
cnf(c_0_119,plain,
( f2(X1)
| t(X2,u10r3(X2,X1))
| ~ r2(X1,X2)
| ~ t2(X2,X3)
| ~ d(X3) ),
c_0_92,
[final] ).
cnf(c_0_120,plain,
( d(u10r5(X1))
| ~ f2(X1) ),
c_0_93,
[final] ).
cnf(c_0_121,plain,
( f2(X1)
| t(X2,u10r1(X2,X1))
| ~ r2(X1,X2)
| ~ t2(X2,X3)
| ~ d(X3) ),
c_0_94,
[final] ).
cnf(c_0_122,plain,
( f2(X1)
| t(X2,u10r2(X2,X1))
| ~ r2(X1,X2)
| ~ t2(X2,X3)
| ~ d(X3) ),
c_0_95,
[final] ).
cnf(c_0_123,plain,
( f1(X1)
| t(X2,u9r3(X2,X1))
| ~ r1(X1,X2)
| ~ t1(X2,X3)
| ~ c(X3) ),
c_0_96,
[final] ).
cnf(c_0_124,plain,
( c(u9r5(X1))
| ~ f1(X1) ),
c_0_97,
[final] ).
cnf(c_0_125,plain,
( f1(X1)
| t(X2,u9r1(X2,X1))
| ~ r1(X1,X2)
| ~ t1(X2,X3)
| ~ c(X3) ),
c_0_98,
[final] ).
cnf(c_0_126,plain,
( r2least(X1)
| equalish(X2,u11r4(X1))
| ~ f3(X1)
| ~ r(X1,X2) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]),
[final] ).
cnf(c_0_127,plain,
( r2least(X1)
| equalish(X2,u10r4(X1))
| ~ f2(X1)
| ~ r(X1,X2) ),
inference(spm,[status(thm)],[c_0_99,c_0_101]),
[final] ).
cnf(c_0_128,plain,
( f1(X1)
| t(X2,u9r2(X2,X1))
| ~ r1(X1,X2)
| ~ t1(X2,X3)
| ~ c(X3) ),
c_0_102,
[final] ).
cnf(c_0_129,plain,
( r2least(X1)
| equalish(X2,u9r4(X1))
| ~ f1(X1)
| ~ r(X1,X2) ),
inference(spm,[status(thm)],[c_0_99,c_0_103]),
[final] ).
cnf(c_0_130,plain,
( ~ d(X1)
| ~ e(X1) ),
c_0_104,
[final] ).
cnf(c_0_131,plain,
( ~ c(X1)
| ~ d(X1) ),
c_0_105,
[final] ).
cnf(c_0_132,plain,
( ~ c(X1)
| ~ e(X1) ),
c_0_106,
[final] ).
cnf(c_0_147,negated_conjecture,
~ g(exists),
c_0_107,
[final] ).
cnf(c_0_148,plain,
( g(X1)
| ~ r2least(X1) ),
c_0_108,
[final] ).
cnf(c_0_149,plain,
( f3(X1)
| ~ f(X1) ),
c_0_109,
[final] ).
cnf(c_0_150,negated_conjecture,
f(exists),
clause_1,
[final] ).
cnf(c_0_151,plain,
( f2(X1)
| ~ f(X1) ),
c_0_110,
[final] ).
cnf(c_0_152,plain,
( f1(X1)
| ~ f(X1) ),
c_0_111,
[final] ).
cnf(c_0_153,plain,
( equalish(u11r5(X1),u11r5(X1))
| ~ f3(X1) ),
inference(spm,[status(thm)],[c_0_112,c_0_73]),
[final] ).
cnf(c_0_154,plain,
( equalish(u10r5(X1),u10r5(X1))
| ~ f2(X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_75]),
[final] ).
cnf(c_0_155,plain,
( equalish(u9r5(X1),u9r5(X1))
| ~ f1(X1) ),
inference(spm,[status(thm)],[c_0_114,c_0_77]),
[final] ).
cnf(c_0_156,plain,
( f3(X1)
| t(u11r4(X2),u11r3(u11r4(X2),X1))
| ~ f3(X2)
| ~ r3(X1,u11r4(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_59]),c_0_116]),
[final] ).
cnf(c_0_157,plain,
( f3(X1)
| t(u11r4(X2),u11r1(u11r4(X2),X1))
| ~ f3(X2)
| ~ r3(X1,u11r4(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_59]),c_0_116]),
[final] ).
cnf(c_0_158,plain,
( f3(X1)
| t(u11r4(X2),u11r2(u11r4(X2),X1))
| ~ f3(X2)
| ~ r3(X1,u11r4(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_59]),c_0_116]),
[final] ).
cnf(c_0_159,plain,
( f2(X1)
| t(u10r4(X2),u10r3(u10r4(X2),X1))
| ~ f2(X2)
| ~ r2(X1,u10r4(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_62]),c_0_120]),
[final] ).
cnf(c_0_160,plain,
( f2(X1)
| t(u10r4(X2),u10r1(u10r4(X2),X1))
| ~ f2(X2)
| ~ r2(X1,u10r4(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_62]),c_0_120]),
[final] ).
cnf(c_0_161,plain,
( f2(X1)
| t(u10r4(X2),u10r2(u10r4(X2),X1))
| ~ f2(X2)
| ~ r2(X1,u10r4(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_62]),c_0_120]),
[final] ).
cnf(c_0_162,plain,
( f1(X1)
| t(u9r4(X2),u9r3(u9r4(X2),X1))
| ~ f1(X2)
| ~ r1(X1,u9r4(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_65]),c_0_124]),
[final] ).
cnf(c_0_163,plain,
( f1(X1)
| t(u9r4(X2),u9r1(u9r4(X2),X1))
| ~ f1(X2)
| ~ r1(X1,u9r4(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_65]),c_0_124]),
[final] ).
cnf(c_0_164,plain,
( r2least(X1)
| equalish(u9r4(X1),u11r4(X1))
| ~ f3(X1)
| ~ f1(X1) ),
inference(spm,[status(thm)],[c_0_126,c_0_103]),
[final] ).
cnf(c_0_165,plain,
( r2least(X1)
| equalish(u10r4(X1),u11r4(X1))
| ~ f3(X1)
| ~ f2(X1) ),
inference(spm,[status(thm)],[c_0_126,c_0_101]),
[final] ).
cnf(c_0_166,plain,
( r2least(X1)
| equalish(u9r4(X1),u10r4(X1))
| ~ f2(X1)
| ~ f1(X1) ),
inference(spm,[status(thm)],[c_0_127,c_0_103]),
[final] ).
cnf(c_0_167,plain,
( r2least(X1)
| equalish(u11r4(X1),u10r4(X1))
| ~ f3(X1)
| ~ f2(X1) ),
inference(spm,[status(thm)],[c_0_127,c_0_100]),
[final] ).
cnf(c_0_168,plain,
( f1(X1)
| t(u9r4(X2),u9r2(u9r4(X2),X1))
| ~ f1(X2)
| ~ r1(X1,u9r4(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_65]),c_0_124]),
[final] ).
cnf(c_0_169,plain,
( r2least(X1)
| equalish(u10r4(X1),u9r4(X1))
| ~ f2(X1)
| ~ f1(X1) ),
inference(spm,[status(thm)],[c_0_129,c_0_101]),
[final] ).
cnf(c_0_170,plain,
( r2least(X1)
| equalish(u11r4(X1),u9r4(X1))
| ~ f3(X1)
| ~ f1(X1) ),
inference(spm,[status(thm)],[c_0_129,c_0_100]),
[final] ).
cnf(c_0_171,plain,
( r2least(X1)
| equalish(u11r4(X1),u11r4(X1))
| ~ f3(X1) ),
inference(spm,[status(thm)],[c_0_126,c_0_100]),
[final] ).
cnf(c_0_172,plain,
( r2least(X1)
| equalish(u10r4(X1),u10r4(X1))
| ~ f2(X1) ),
inference(spm,[status(thm)],[c_0_127,c_0_101]),
[final] ).
cnf(c_0_173,plain,
( r2least(X1)
| equalish(u9r4(X1),u9r4(X1))
| ~ f1(X1) ),
inference(spm,[status(thm)],[c_0_129,c_0_103]),
[final] ).
cnf(c_0_174,plain,
( ~ f2(X1)
| ~ e(u10r5(X1)) ),
inference(spm,[status(thm)],[c_0_130,c_0_120]),
[final] ).
cnf(c_0_175,plain,
( ~ f2(X1)
| ~ c(u10r5(X1)) ),
inference(spm,[status(thm)],[c_0_131,c_0_120]),
[final] ).
cnf(c_0_176,plain,
( ~ f3(X1)
| ~ c(u11r5(X1)) ),
inference(spm,[status(thm)],[c_0_132,c_0_116]),
[final] ).
cnf(c_0_177,plain,
( f3(X1)
| ~ r3(X1,X2)
| ~ equalish(u11r3(X2,X1),u11r1(X2,X1))
| ~ t3(X2,X3)
| ~ e(X3) ),
c_0_133,
[final] ).
cnf(c_0_178,plain,
( f3(X1)
| ~ r3(X1,X2)
| ~ equalish(u11r3(X2,X1),u11r2(X2,X1))
| ~ t3(X2,X3)
| ~ e(X3) ),
c_0_134,
[final] ).
cnf(c_0_179,plain,
( f3(X1)
| ~ r3(X1,X2)
| ~ equalish(u11r2(X2,X1),u11r1(X2,X1))
| ~ t3(X2,X3)
| ~ e(X3) ),
c_0_135,
[final] ).
cnf(c_0_180,plain,
( f2(X1)
| ~ r2(X1,X2)
| ~ equalish(u10r3(X2,X1),u10r1(X2,X1))
| ~ t2(X2,X3)
| ~ d(X3) ),
c_0_136,
[final] ).
cnf(c_0_181,plain,
( f2(X1)
| ~ r2(X1,X2)
| ~ equalish(u10r3(X2,X1),u10r2(X2,X1))
| ~ t2(X2,X3)
| ~ d(X3) ),
c_0_137,
[final] ).
cnf(c_0_182,plain,
( f2(X1)
| ~ r2(X1,X2)
| ~ equalish(u10r2(X2,X1),u10r1(X2,X1))
| ~ t2(X2,X3)
| ~ d(X3) ),
c_0_138,
[final] ).
cnf(c_0_183,plain,
( f1(X1)
| ~ r1(X1,X2)
| ~ equalish(u9r3(X2,X1),u9r1(X2,X1))
| ~ t1(X2,X3)
| ~ c(X3) ),
c_0_139,
[final] ).
cnf(c_0_184,plain,
( f1(X1)
| ~ r1(X1,X2)
| ~ equalish(u9r3(X2,X1),u9r2(X2,X1))
| ~ t1(X2,X3)
| ~ c(X3) ),
c_0_140,
[final] ).
cnf(c_0_185,plain,
( f1(X1)
| ~ r1(X1,X2)
| ~ equalish(u9r2(X2,X1),u9r1(X2,X1))
| ~ t1(X2,X3)
| ~ c(X3) ),
c_0_141,
[final] ).
cnf(c_0_186,plain,
( r(X1,u14r1(X1))
| ~ r2least(X1) ),
c_0_142,
[final] ).
cnf(c_0_187,plain,
( r(X1,u14r2(X1))
| ~ r2least(X1) ),
c_0_143,
[final] ).
cnf(c_0_188,plain,
( f(X1)
| ~ f1(X1)
| ~ f2(X1)
| ~ f3(X1) ),
c_0_144,
[final] ).
cnf(c_0_189,plain,
( ~ r2least(X1)
| ~ equalish(u14r2(X1),u14r1(X1)) ),
c_0_145,
[final] ).
cnf(c_0_190,plain,
( r2least(X1)
| ~ g(X1) ),
c_0_146,
[final] ).
cnf(c_0_191,negated_conjecture,
~ r2least(exists),
inference(spm,[status(thm)],[c_0_147,c_0_148]),
[final] ).
cnf(c_0_192,negated_conjecture,
f3(exists),
inference(spm,[status(thm)],[c_0_149,c_0_150]),
[final] ).
cnf(c_0_193,negated_conjecture,
f2(exists),
inference(spm,[status(thm)],[c_0_151,c_0_150]),
[final] ).
cnf(c_0_194,negated_conjecture,
f1(exists),
inference(spm,[status(thm)],[c_0_152,c_0_150]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : KRS011-1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:55:23 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.21/0.53 Running first-order theorem proving
% 0.21/0.53 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.nsze1jlBsc/E---3.1_26607.p
% 0.21/0.56 # Version: 3.1.0
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 26693 completed with status 1
% 0.21/0.56 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # No SInE strategy applied
% 0.21/0.56 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.21/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.56 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.56 # Starting sh5l with 136s (1) cores
% 0.21/0.56 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 26701 completed with status 1
% 0.21/0.56 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # No SInE strategy applied
% 0.21/0.56 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.21/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.56 # Preprocessing time : 0.002 s
% 0.21/0.56 # Presaturation interreduction done
% 0.21/0.56
% 0.21/0.56 # No proof found!
% 0.21/0.56 # SZS status Satisfiable
% 0.21/0.56 # SZS output start Saturation
% See solution above
% 0.21/0.56 # Parsed axioms : 54
% 0.21/0.56 # Removed by relevancy pruning/SinE : 0
% 0.21/0.56 # Initial clauses : 54
% 0.21/0.56 # Removed in clause preprocessing : 0
% 0.21/0.56 # Initial clauses in saturation : 54
% 0.21/0.56 # Processed clauses : 148
% 0.21/0.56 # ...of these trivial : 0
% 0.21/0.56 # ...subsumed : 3
% 0.21/0.56 # ...remaining for further processing : 145
% 0.21/0.56 # Other redundant clauses eliminated : 0
% 0.21/0.56 # Clauses deleted for lack of memory : 0
% 0.21/0.56 # Backward-subsumed : 3
% 0.21/0.56 # Backward-rewritten : 0
% 0.21/0.56 # Generated clauses : 64
% 0.21/0.56 # ...of the previous two non-redundant : 43
% 0.21/0.56 # ...aggressively subsumed : 0
% 0.21/0.56 # Contextual simplify-reflections : 9
% 0.21/0.56 # Paramodulations : 64
% 0.21/0.56 # Factorizations : 0
% 0.21/0.56 # NegExts : 0
% 0.21/0.56 # Equation resolutions : 0
% 0.21/0.56 # Disequality decompositions : 0
% 0.21/0.56 # Total rewrite steps : 0
% 0.21/0.56 # ...of those cached : 0
% 0.21/0.56 # Propositional unsat checks : 0
% 0.21/0.56 # Propositional check models : 0
% 0.21/0.56 # Propositional check unsatisfiable : 0
% 0.21/0.56 # Propositional clauses : 0
% 0.21/0.56 # Propositional clauses after purity: 0
% 0.21/0.56 # Propositional unsat core size : 0
% 0.21/0.56 # Propositional preprocessing time : 0.000
% 0.21/0.56 # Propositional encoding time : 0.000
% 0.21/0.56 # Propositional solver time : 0.000
% 0.21/0.56 # Success case prop preproc time : 0.000
% 0.21/0.56 # Success case prop encoding time : 0.000
% 0.21/0.56 # Success case prop solver time : 0.000
% 0.21/0.56 # Current number of processed clauses : 91
% 0.21/0.56 # Positive orientable unit clauses : 4
% 0.21/0.56 # Positive unorientable unit clauses: 0
% 0.21/0.56 # Negative unit clauses : 2
% 0.21/0.56 # Non-unit-clauses : 85
% 0.21/0.56 # Current number of unprocessed clauses: 0
% 0.21/0.56 # ...number of literals in the above : 0
% 0.21/0.56 # Current number of archived formulas : 0
% 0.21/0.56 # Current number of archived clauses : 54
% 0.21/0.56 # Clause-clause subsumption calls (NU) : 5884
% 0.21/0.56 # Rec. Clause-clause subsumption calls : 985
% 0.21/0.56 # Non-unit clause-clause subsumptions : 15
% 0.21/0.56 # Unit Clause-clause subsumption calls : 16
% 0.21/0.56 # Rewrite failures with RHS unbound : 0
% 0.21/0.56 # BW rewrite match attempts : 0
% 0.21/0.56 # BW rewrite match successes : 0
% 0.21/0.56 # Condensation attempts : 0
% 0.21/0.56 # Condensation successes : 0
% 0.21/0.56 # Termbank termtop insertions : 4200
% 0.21/0.56 # Search garbage collected termcells : 188
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.014 s
% 0.21/0.56 # System time : 0.002 s
% 0.21/0.56 # Total time : 0.015 s
% 0.21/0.56 # Maximum resident set size: 1728 pages
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.060 s
% 0.21/0.56 # System time : 0.009 s
% 0.21/0.56 # Total time : 0.069 s
% 0.21/0.56 # Maximum resident set size: 1740 pages
% 0.21/0.56 % E---3.1 exiting
% 0.21/0.56 % E exiting
%------------------------------------------------------------------------------