%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX203-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:14:15 PM UTC 2026
% Result : Unsatisfiable 7.00s 1.39s
% Output : CNFRefutation 7.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 25
% Syntax : Number of clauses : 84 ( 84 unt; 0 nHn; 12 RR)
% Number of literals : 84 ( 83 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 4 con; 0-3 aty)
% Number of variables : 137 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_012,axiom,
elemNat(X1,cons(X2,X3)) = orb(eq(X1,X2),elemNat(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_012) ).
cnf(axiom_027,axiom,
eq(s(X1),s(X2)) = eq(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_027) ).
cnf(axiom_029,axiom,
eq(s(X1),z) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_029) ).
cnf(axiom_003,axiom,
orb(bfalse,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
cnf(axiom_011,axiom,
elemNat(X1,nil) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_011) ).
cnf(axiom_023,axiom,
sorted(cons(X1,cons(X2,X3))) = andb(leqNat(X1,X2),sorted(cons(X2,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_023) ).
cnf(axiom_022,axiom,
sorted(cons(X1,nil)) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_022) ).
cnf(axiom_014,axiom,
unique(cons(X1,X2)) = aux(X1,X2,elemNat(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_014) ).
cnf(axiom_001,axiom,
aux(X1,X2,bfalse) = unique(X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_001) ).
cnf(axiom_013,axiom,
unique(nil) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_013) ).
cnf(axiom_018,axiom,
rev(cons(X1,X2)) = append(rev(X2),cons(X1,nil)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_018) ).
cnf(axiom_017,axiom,
rev(nil) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_017) ).
cnf(axiom_015,axiom,
append(nil,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_015) ).
cnf(axiom_006,axiom,
leqNat(s(X1),s(X2)) = leqNat(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_006) ).
cnf(axiom_016,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_016) ).
cnf(axiom_004,axiom,
leqNat(z,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_004) ).
cnf(axiom_019,axiom,
andb(btrue,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_019) ).
cnf(goal,negated_conjecture,
eq2(psorted_rev(X1),bfalse) != btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(axiom_024,axiom,
psorted_rev(X1) = impl(eq2(sorted(rev(X1)),btrue),impl(eq2(unique(X1),btrue),eq2(leqNat(lengthNat(X1),s(s(s(z)))),btrue))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_024) ).
cnf(axiom_031,axiom,
eq2(X1,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_031) ).
cnf(axiom_008,axiom,
lengthNat(cons(X1,X2)) = s(lengthNat(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_008) ).
cnf(axiom_007,axiom,
lengthNat(nil) = z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).
cnf(axiom_005,axiom,
leqNat(s(X1),z) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_005) ).
cnf(axiom_025,axiom,
eq2(bfalse,btrue) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_025) ).
cnf(axiom_009,axiom,
impl(btrue,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_009) ).
cnf(c_0_25,axiom,
elemNat(X1,cons(X2,X3)) = orb(eq(X1,X2),elemNat(X1,X3)),
axiom_012 ).
cnf(c_0_26,axiom,
eq(s(X1),s(X2)) = eq(X1,X2),
axiom_027 ).
cnf(c_0_27,plain,
orb(eq(X1,X2),elemNat(s(X1),X3)) = elemNat(s(X1),cons(s(X2),X3)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,axiom,
eq(s(X1),z) = bfalse,
axiom_029 ).
cnf(c_0_29,axiom,
orb(bfalse,X1) = X1,
axiom_003 ).
cnf(c_0_30,plain,
elemNat(s(s(X1)),cons(s(z),X2)) = elemNat(s(s(X1)),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_31,plain,
elemNat(s(X1),cons(z,X2)) = elemNat(s(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_28]),c_0_29]) ).
cnf(c_0_32,axiom,
elemNat(X1,nil) = bfalse,
axiom_011 ).
cnf(c_0_33,axiom,
sorted(cons(X1,cons(X2,X3))) = andb(leqNat(X1,X2),sorted(cons(X2,X3))),
axiom_023 ).
cnf(c_0_34,axiom,
sorted(cons(X1,nil)) = btrue,
axiom_022 ).
cnf(c_0_35,axiom,
unique(cons(X1,X2)) = aux(X1,X2,elemNat(X1,X2)),
axiom_014 ).
cnf(c_0_36,plain,
elemNat(s(s(X1)),cons(X2,cons(s(z),X3))) = elemNat(s(s(X1)),cons(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_30]),c_0_25]) ).
cnf(c_0_37,plain,
elemNat(s(X1),cons(X2,cons(z,X3))) = elemNat(s(X1),cons(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_31]),c_0_25]) ).
cnf(c_0_38,plain,
orb(eq(X1,X2),bfalse) = elemNat(X1,cons(X2,nil)),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_39,axiom,
aux(X1,X2,bfalse) = unique(X2),
axiom_001 ).
cnf(c_0_40,axiom,
unique(nil) = btrue,
axiom_013 ).
cnf(c_0_41,axiom,
rev(cons(X1,X2)) = append(rev(X2),cons(X1,nil)),
axiom_018 ).
cnf(c_0_42,axiom,
rev(nil) = nil,
axiom_017 ).
cnf(c_0_43,axiom,
append(nil,X1) = X1,
axiom_015 ).
cnf(c_0_44,plain,
andb(leqNat(X1,X2),btrue) = sorted(cons(X1,cons(X2,nil))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_45,axiom,
leqNat(s(X1),s(X2)) = leqNat(X1,X2),
axiom_006 ).
cnf(c_0_46,plain,
aux(s(s(X1)),cons(X2,cons(s(z),X3)),elemNat(s(s(X1)),cons(X2,X3))) = unique(cons(s(s(X1)),cons(X2,cons(s(z),X3)))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_47,plain,
aux(s(X1),cons(X2,cons(z,X3)),elemNat(s(X1),cons(X2,X3))) = unique(cons(s(X1),cons(X2,cons(z,X3)))),
inference(spm,[status(thm)],[c_0_35,c_0_37]) ).
cnf(c_0_48,plain,
elemNat(s(X1),cons(s(X2),nil)) = elemNat(X1,cons(X2,nil)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_26]),c_0_38]) ).
cnf(c_0_49,plain,
elemNat(s(X1),cons(z,nil)) = bfalse,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_28]),c_0_29]) ).
cnf(c_0_50,plain,
unique(cons(X1,nil)) = btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_39]),c_0_40]) ).
cnf(c_0_51,plain,
rev(cons(X1,nil)) = cons(X1,nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_52,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
axiom_016 ).
cnf(c_0_53,plain,
sorted(cons(s(X1),cons(s(X2),nil))) = sorted(cons(X1,cons(X2,nil))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_44]) ).
cnf(c_0_54,plain,
andb(leqNat(X1,X2),sorted(cons(s(X2),X3))) = sorted(cons(s(X1),cons(s(X2),X3))),
inference(spm,[status(thm)],[c_0_33,c_0_45]) ).
cnf(c_0_55,axiom,
leqNat(z,X1) = btrue,
axiom_004 ).
cnf(c_0_56,axiom,
andb(btrue,X1) = X1,
axiom_019 ).
cnf(c_0_57,plain,
aux(s(s(X1)),cons(X2,cons(s(z),cons(z,X3))),elemNat(s(s(X1)),cons(X2,X3))) = unique(cons(s(s(X1)),cons(X2,cons(s(z),cons(z,X3))))),
inference(spm,[status(thm)],[c_0_46,c_0_37]) ).
cnf(c_0_58,plain,
aux(s(X1),cons(s(X2),cons(z,nil)),elemNat(X1,cons(X2,nil))) = unique(cons(s(X1),cons(s(X2),cons(z,nil)))),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_59,plain,
unique(cons(s(X1),cons(z,nil))) = btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_49]),c_0_39]),c_0_50]) ).
cnf(c_0_60,plain,
rev(cons(X1,cons(X2,nil))) = cons(X2,cons(X1,nil)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_51]),c_0_52]),c_0_43]) ).
cnf(c_0_61,plain,
andb(leqNat(X1,s(X2)),sorted(cons(X2,cons(X3,nil)))) = sorted(cons(X1,cons(s(X2),cons(s(X3),nil)))),
inference(spm,[status(thm)],[c_0_33,c_0_53]) ).
cnf(c_0_62,plain,
sorted(cons(s(z),cons(s(X1),X2))) = sorted(cons(s(X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_63,plain,
aux(s(s(X1)),cons(s(X2),cons(s(z),cons(z,nil))),elemNat(s(X1),cons(X2,nil))) = unique(cons(s(s(X1)),cons(s(X2),cons(s(z),cons(z,nil))))),
inference(spm,[status(thm)],[c_0_57,c_0_48]) ).
cnf(c_0_64,plain,
unique(cons(s(s(X1)),cons(s(z),cons(z,nil)))) = btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_31]),c_0_32]),c_0_39]),c_0_59]) ).
cnf(c_0_65,plain,
rev(cons(X1,cons(X2,cons(X3,nil)))) = cons(X3,cons(X2,cons(X1,nil))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_60]),c_0_52]),c_0_52]),c_0_43]) ).
cnf(c_0_66,plain,
sorted(cons(X1,cons(s(s(z)),cons(s(s(X2)),nil)))) = sorted(cons(X1,cons(s(s(z)),nil))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_34]),c_0_44]) ).
cnf(c_0_67,plain,
andb(leqNat(X1,s(z)),sorted(cons(s(X2),X3))) = sorted(cons(X1,cons(s(z),cons(s(X2),X3)))),
inference(spm,[status(thm)],[c_0_33,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
eq2(psorted_rev(X1),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_69,axiom,
psorted_rev(X1) = impl(eq2(sorted(rev(X1)),btrue),impl(eq2(unique(X1),btrue),eq2(leqNat(lengthNat(X1),s(s(s(z)))),btrue))),
axiom_024 ).
cnf(c_0_70,plain,
unique(cons(s(s(s(X1))),cons(s(s(z)),cons(s(z),cons(z,nil))))) = btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_30]),c_0_32]),c_0_39]),c_0_64]) ).
cnf(c_0_71,plain,
rev(cons(X1,cons(X2,cons(X3,cons(X4,nil))))) = cons(X4,cons(X3,cons(X2,cons(X1,nil)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_65]),c_0_52]),c_0_52]),c_0_52]),c_0_43]) ).
cnf(c_0_72,plain,
sorted(cons(X1,cons(X2,cons(s(s(z)),cons(s(s(X3)),nil))))) = sorted(cons(X1,cons(X2,cons(s(s(z)),nil)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_66]),c_0_33]) ).
cnf(c_0_73,plain,
sorted(cons(X1,cons(s(z),cons(s(X2),nil)))) = sorted(cons(X1,cons(s(z),nil))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_34]),c_0_44]) ).
cnf(c_0_74,plain,
sorted(cons(z,cons(X1,X2))) = sorted(cons(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_55]),c_0_56]) ).
cnf(c_0_75,axiom,
eq2(X1,X1) = btrue,
axiom_031 ).
cnf(c_0_76,axiom,
lengthNat(cons(X1,X2)) = s(lengthNat(X2)),
axiom_008 ).
cnf(c_0_77,axiom,
lengthNat(nil) = z,
axiom_007 ).
cnf(c_0_78,axiom,
leqNat(s(X1),z) = bfalse,
axiom_005 ).
cnf(c_0_79,axiom,
eq2(bfalse,btrue) = bfalse,
axiom_025 ).
cnf(c_0_80,axiom,
impl(btrue,X1) = X1,
axiom_009 ).
cnf(c_0_81,negated_conjecture,
eq2(psorted_rev(X1),bfalse) != btrue,
c_0_68 ).
cnf(c_0_82,plain,
psorted_rev(cons(s(s(s(X1))),cons(s(s(z)),cons(s(z),cons(z,nil))))) = bfalse,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_72]),c_0_73]),c_0_74]),c_0_34]),c_0_75]),c_0_75]),c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_77]),c_0_45]),c_0_45]),c_0_45]),c_0_78]),c_0_79]),c_0_80]),c_0_80]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX203-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 10:28:56 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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/benchmark/theBenchmark.p
% 7.00/1.39 % Version: 3.5.1
% 7.00/1.39 % Preprocessing class: FSMSSMSSSSSNFFN.
% 7.00/1.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.00/1.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.00/1.39 % Starting new_bool_3 with 300s (1) cores
% 7.00/1.39 % Starting new_bool_1 with 300s (1) cores
% 7.00/1.39 % Starting sh5l with 300s (1) cores
% 7.00/1.39 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2099843 completed with status 0
% 7.00/1.39 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 7.00/1.39 % Preprocessing class: FSMSSMSSSSSNFFN.
% 7.00/1.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.00/1.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.00/1.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.00/1.39 % No SInE strategy applied
% 7.00/1.39 % Search class: FUUPM-FFMM31-DFFFFFNN
% 7.00/1.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.00/1.39 % Starting SubtermCWHack with 136s (1) cores
% 7.00/1.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 7.00/1.39 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 254s (1) cores
% 7.00/1.39 % Starting new_bool_3 with 254s (1) cores
% 7.00/1.39 % Starting new_bool_1 with 254s (1) cores
% 7.00/1.39 % new_bool_3 with pid 2099853 completed with status 0
% 7.00/1.39 % Result found by new_bool_3
% 7.00/1.39 % Preprocessing class: FSMSSMSSSSSNFFN.
% 7.00/1.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.00/1.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.00/1.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.00/1.39 % No SInE strategy applied
% 7.00/1.39 % Search class: FUUPM-FFMM31-DFFFFFNN
% 7.00/1.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.00/1.39 % Starting SubtermCWHack with 136s (1) cores
% 7.00/1.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 7.00/1.39 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 254s (1) cores
% 7.00/1.39 % Starting new_bool_3 with 254s (1) cores
% 7.00/1.39 % Preprocessing time : 0.001 s
% 7.00/1.39 % Presaturation interreduction done
% 7.00/1.39
% 7.00/1.39 % Proof found!
% 7.00/1.39 % SZS status Unsatisfiable
% 7.00/1.39 % SZS output start CNFRefutation
% See solution above
% 7.00/1.39 % Parsed axioms : 33
% 7.00/1.39 % Removed by relevancy pruning/SinE : 0
% 7.00/1.39 % Initial clauses : 33
% 7.00/1.39 % Removed in clause preprocessing : 0
% 7.00/1.39 % Initial clauses in saturation : 33
% 7.00/1.39 % Processed clauses : 6523
% 7.00/1.39 % ...of these trivial : 1890
% 7.00/1.39 % ...subsumed : 2710
% 7.00/1.39 % ...remaining for further processing : 1923
% 7.00/1.39 % Other redundant clauses eliminated : 0
% 7.00/1.39 % Clauses deleted for lack of memory : 0
% 7.00/1.39 % Backward-subsumed : 12
% 7.00/1.39 % Backward-rewritten : 267
% 7.00/1.39 % Generated clauses : 45310
% 7.00/1.39 % ...of the previous two non-redundant : 27681
% 7.00/1.39 % ...aggressively subsumed : 0
% 7.00/1.39 % Contextual simplify-reflections : 0
% 7.00/1.39 % Paramodulations : 45310
% 7.00/1.39 % Factorizations : 0
% 7.00/1.39 % NegExts : 0
% 7.00/1.39 % Equation resolutions : 0
% 7.00/1.39 % Disequality decompositions : 0
% 7.00/1.39 % Total rewrite steps : 102833
% 7.00/1.39 % ...of those cached : 77118
% 7.00/1.39 % Propositional unsat checks : 0
% 7.00/1.39 % Propositional check models : 0
% 7.00/1.39 % Propositional check unsatisfiable : 0
% 7.00/1.39 % Propositional clauses : 0
% 7.00/1.39 % Propositional clauses after purity: 0
% 7.00/1.39 % Propositional unsat core size : 0
% 7.00/1.39 % Propositional preprocessing time : 0.000
% 7.00/1.39 % Propositional encoding time : 0.000
% 7.00/1.39 % Propositional solver time : 0.000
% 7.00/1.39 % Success case prop preproc time : 0.000
% 7.00/1.39 % Success case prop encoding time : 0.000
% 7.00/1.39 % Success case prop solver time : 0.000
% 7.00/1.39 % Current number of processed clauses : 1611
% 7.00/1.39 % Positive orientable unit clauses : 1530
% 7.00/1.39 % Positive unorientable unit clauses: 59
% 7.00/1.39 % Negative unit clauses : 22
% 7.00/1.39 % Non-unit-clauses : 0
% 7.00/1.39 % Current number of unprocessed clauses: 20725
% 7.00/1.39 % ...number of literals in the above : 20725
% 7.00/1.39 % Current number of archived formulas : 0
% 7.00/1.39 % Current number of archived clauses : 312
% 7.00/1.39 % Clause-clause subsumption calls (NU) : 0
% 7.00/1.39 % Rec. Clause-clause subsumption calls : 0
% 7.00/1.39 % Non-unit clause-clause subsumptions : 0
% 7.00/1.39 % Unit Clause-clause subsumption calls : 561
% 7.00/1.39 % Rewrite failures with RHS unbound : 3100
% 7.00/1.39 % BW rewrite match attempts : 250580
% 7.00/1.39 % BW rewrite match successes : 550
% 7.00/1.39 % Condensation attempts : 0
% 7.00/1.39 % Condensation successes : 0
% 7.00/1.39 % Termbank termtop insertions : 1803983
% 7.00/1.39 % Search garbage collected termcells : 2
% 7.00/1.39
% 7.00/1.39 % -------------------------------------------------
% 7.00/1.39 % User time : 0.850 s
% 7.00/1.39 % System time : 0.038 s
% 7.00/1.39 % Total time : 0.888 s
% 7.00/1.39 % Maximum resident set size: 3656 pages
% 7.00/1.39
% 7.00/1.39 % -------------------------------------------------
% 7.00/1.39 % User time : 4.387 s
% 7.00/1.39 % System time : 0.206 s
% 7.00/1.39 % Total time : 4.594 s
% 7.00/1.39 % Maximum resident set size: 4864 pages
% 7.00/1.39 % E exiting
%------------------------------------------------------------------------------