%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN036-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:31:51 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 30
% Syntax : Number of clauses : 120 ( 6 unt; 24 nHn; 95 RR)
% Number of literals : 306 ( 0 equ; 155 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 9 prp; 0-1 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 63 ( 41 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_18,negated_conjecture,
( ~ q(X2)
| ~ n5(X1)
| q(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_18) ).
cnf(clause_14,negated_conjecture,
( ~ n6
| n5(s6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).
cnf(clause_28,negated_conjecture,
( ~ p(X2)
| ~ n1(X1)
| p(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_28) ).
cnf(clause_24,negated_conjecture,
( ~ n2
| n1(s2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_24) ).
cnf(clause_17,negated_conjecture,
( ~ q(X1)
| ~ n5(X1)
| q(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_22,negated_conjecture,
( ~ n3
| q(s3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_22) ).
cnf(clause_27,negated_conjecture,
( ~ p(X1)
| ~ n1(X1)
| p(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_27) ).
cnf(clause_12,negated_conjecture,
( ~ n7
| p(s7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_12) ).
cnf(clause_21,negated_conjecture,
( ~ q(X1)
| n3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_21) ).
cnf(clause_20,negated_conjecture,
( ~ n4
| q(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_20) ).
cnf(clause_11,negated_conjecture,
( ~ p(X1)
| n7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_10,negated_conjecture,
( ~ n8
| p(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_15,negated_conjecture,
( ~ q(s5(X1))
| ~ q(X1)
| n5(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_13,negated_conjecture,
( ~ n5(X1)
| n6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_13) ).
cnf(clause_16,negated_conjecture,
( n5(X1)
| q(s5(X1))
| q(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_19,negated_conjecture,
( ~ q(s4)
| n4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_19) ).
cnf(clause_29,negated_conjecture,
( ~ n4
| ~ n3
| n9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_29) ).
cnf(clause_9,negated_conjecture,
( ~ p(s8)
| n8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_33,negated_conjecture,
( ~ n8
| ~ n7
| n10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_33) ).
cnf(clause_31,negated_conjecture,
( ~ n9
| ~ n3
| n4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_31) ).
cnf(clause_30,negated_conjecture,
( n9
| n4
| n3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_30) ).
cnf(clause_34,negated_conjecture,
( n10
| n8
| n7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_34) ).
cnf(clause_23,negated_conjecture,
( ~ n1(X1)
| n2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_23) ).
cnf(clause_26,negated_conjecture,
( n1(X1)
| p(s1(X1))
| p(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_26) ).
cnf(clause_7,negated_conjecture,
( ~ n6
| ~ n9
| n10
| n2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_4,negated_conjecture,
( n10
| n6
| n9
| n2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,negated_conjecture,
( ~ n10
| ~ n2
| n6
| n9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_35,negated_conjecture,
( ~ n10
| ~ n7
| n8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_35) ).
cnf(clause_1,negated_conjecture,
( ~ n10
| ~ n6
| ~ n9
| ~ n2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_25,negated_conjecture,
( ~ p(s1(X1))
| ~ p(X1)
| n1(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_25) ).
cnf(c_0_30,negated_conjecture,
( ~ q(X2)
| ~ n5(X1)
| q(X1) ),
inference(fof_simplification,[status(thm)],[clause_18]) ).
cnf(c_0_31,negated_conjecture,
( ~ n6
| n5(s6) ),
inference(fof_simplification,[status(thm)],[clause_14]) ).
cnf(c_0_32,negated_conjecture,
( ~ p(X2)
| ~ n1(X1)
| p(X1) ),
inference(fof_simplification,[status(thm)],[clause_28]) ).
cnf(c_0_33,negated_conjecture,
( ~ n2
| n1(s2) ),
inference(fof_simplification,[status(thm)],[clause_24]) ).
cnf(c_0_34,negated_conjecture,
( ~ q(X1)
| ~ n5(X1)
| q(X2) ),
inference(fof_simplification,[status(thm)],[clause_17]) ).
cnf(c_0_35,negated_conjecture,
( ~ q(X2)
| ~ n5(X1)
| q(X1) ),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
( ~ n6
| n5(s6) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
( ~ n3
| q(s3) ),
inference(fof_simplification,[status(thm)],[clause_22]) ).
cnf(c_0_38,negated_conjecture,
( ~ p(X1)
| ~ n1(X1)
| p(X2) ),
inference(fof_simplification,[status(thm)],[clause_27]) ).
cnf(c_0_39,negated_conjecture,
( ~ p(X2)
| ~ n1(X1)
| p(X1) ),
c_0_32 ).
cnf(c_0_40,negated_conjecture,
( ~ n2
| n1(s2) ),
c_0_33 ).
cnf(c_0_41,negated_conjecture,
( ~ n7
| p(s7) ),
inference(fof_simplification,[status(thm)],[clause_12]) ).
cnf(c_0_42,negated_conjecture,
( ~ q(X1)
| n3 ),
inference(fof_simplification,[status(thm)],[clause_21]) ).
cnf(c_0_43,negated_conjecture,
( ~ q(X1)
| ~ n5(X1)
| q(X2) ),
c_0_34 ).
cnf(c_0_44,negated_conjecture,
( ~ n6
| ~ q(X1)
| q(s6) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
( ~ n3
| q(s3) ),
c_0_37 ).
cnf(c_0_46,negated_conjecture,
( ~ n4
| q(X1) ),
inference(fof_simplification,[status(thm)],[clause_20]) ).
cnf(c_0_47,negated_conjecture,
( ~ p(X1)
| ~ n1(X1)
| p(X2) ),
c_0_38 ).
cnf(c_0_48,negated_conjecture,
( ~ n2
| ~ p(X1)
| p(s2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_49,negated_conjecture,
( ~ n7
| p(s7) ),
c_0_41 ).
cnf(c_0_50,negated_conjecture,
( ~ p(X1)
| n7 ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_51,negated_conjecture,
( ~ n8
| p(X1) ),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_52,negated_conjecture,
( ~ q(s5(X1))
| ~ q(X1)
| n5(X1) ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_53,negated_conjecture,
( ~ n5(X1)
| n6 ),
inference(fof_simplification,[status(thm)],[clause_13]) ).
cnf(c_0_54,negated_conjecture,
( ~ q(X1)
| n3 ),
c_0_42 ).
cnf(c_0_55,negated_conjecture,
( n5(X1)
| q(s5(X1))
| q(X1) ),
clause_16 ).
cnf(c_0_56,negated_conjecture,
( ~ q(s4)
| n4 ),
inference(fof_simplification,[status(thm)],[clause_19]) ).
cnf(c_0_57,negated_conjecture,
( ~ n6
| ~ q(s6)
| q(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_36]) ).
cnf(c_0_58,negated_conjecture,
( ~ n6
| ~ n3
| q(s6) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_59,negated_conjecture,
( ~ n4
| ~ n3
| n9 ),
inference(fof_simplification,[status(thm)],[clause_29]) ).
cnf(c_0_60,negated_conjecture,
( ~ n4
| q(X1) ),
c_0_46 ).
cnf(c_0_61,negated_conjecture,
( ~ p(s8)
| n8 ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_62,negated_conjecture,
( ~ n2
| ~ p(s2)
| p(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_40]) ).
cnf(c_0_63,negated_conjecture,
( ~ n2
| ~ n7
| p(s2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_64,negated_conjecture,
( ~ n8
| ~ n7
| n10 ),
inference(fof_simplification,[status(thm)],[clause_33]) ).
cnf(c_0_65,negated_conjecture,
( ~ p(X1)
| n7 ),
c_0_50 ).
cnf(c_0_66,negated_conjecture,
( ~ n8
| p(X1) ),
c_0_51 ).
cnf(c_0_67,negated_conjecture,
( ~ q(s5(X1))
| ~ q(X1)
| n5(X1) ),
c_0_52 ).
cnf(c_0_68,negated_conjecture,
( ~ n9
| ~ n3
| n4 ),
inference(fof_simplification,[status(thm)],[clause_31]) ).
cnf(c_0_69,negated_conjecture,
( ~ n5(X1)
| n6 ),
c_0_53 ).
cnf(c_0_70,negated_conjecture,
( n5(X1)
| n3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_54]) ).
cnf(c_0_71,negated_conjecture,
( ~ q(s4)
| n4 ),
c_0_56 ).
cnf(c_0_72,negated_conjecture,
( ~ n6
| ~ n3
| q(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_73,negated_conjecture,
( ~ n4
| ~ n3
| n9 ),
c_0_59 ).
cnf(c_0_74,negated_conjecture,
( ~ n4
| n3 ),
inference(spm,[status(thm)],[c_0_54,c_0_60]) ).
cnf(c_0_75,negated_conjecture,
( ~ p(s8)
| n8 ),
c_0_61 ).
cnf(c_0_76,negated_conjecture,
( ~ n2
| ~ n7
| p(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_77,negated_conjecture,
( ~ n8
| ~ n7
| n10 ),
c_0_64 ).
cnf(c_0_78,negated_conjecture,
( ~ n8
| n7 ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_79,negated_conjecture,
( ~ n4
| n5(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_60]),c_0_60]) ).
cnf(c_0_80,negated_conjecture,
( ~ n9
| ~ n3
| n4 ),
c_0_68 ).
cnf(c_0_81,negated_conjecture,
( n6
| n3 ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_82,negated_conjecture,
( ~ n6
| ~ n3
| n4 ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_83,negated_conjecture,
( n9
| n4
| n3 ),
clause_30 ).
cnf(c_0_84,negated_conjecture,
( ~ n4
| n9 ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_85,negated_conjecture,
( ~ n2
| ~ n7
| n8 ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_86,negated_conjecture,
( n10
| n8
| n7 ),
clause_34 ).
cnf(c_0_87,negated_conjecture,
( ~ n8
| n10 ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_88,negated_conjecture,
( ~ n1(X1)
| n2 ),
inference(fof_simplification,[status(thm)],[clause_23]) ).
cnf(c_0_89,negated_conjecture,
( n1(X1)
| p(s1(X1))
| p(X1) ),
clause_26 ).
cnf(c_0_90,negated_conjecture,
( ~ n6
| ~ n9
| n10
| n2 ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_91,negated_conjecture,
( ~ n4
| n6 ),
inference(spm,[status(thm)],[c_0_69,c_0_79]) ).
cnf(c_0_92,negated_conjecture,
( ~ n9
| n6
| n4 ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_93,negated_conjecture,
( ~ n6
| n9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]) ).
cnf(c_0_94,negated_conjecture,
( n10
| n6
| n9
| n2 ),
clause_4 ).
cnf(c_0_95,negated_conjecture,
( ~ n2
| n10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]) ).
cnf(c_0_96,negated_conjecture,
( ~ n10
| ~ n2
| n6
| n9 ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_97,negated_conjecture,
( ~ n10
| ~ n7
| n8 ),
inference(fof_simplification,[status(thm)],[clause_35]) ).
cnf(c_0_98,negated_conjecture,
( ~ n1(X1)
| n2 ),
c_0_88 ).
cnf(c_0_99,negated_conjecture,
( n7
| n1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_89]),c_0_65]) ).
cnf(c_0_100,negated_conjecture,
( ~ n10
| ~ n6
| ~ n9
| ~ n2 ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_101,negated_conjecture,
( ~ n6
| ~ n9
| n10
| n2 ),
c_0_90 ).
cnf(c_0_102,negated_conjecture,
( ~ n9
| n6 ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_103,negated_conjecture,
( n9
| n10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]) ).
cnf(c_0_104,negated_conjecture,
( ~ n10
| ~ n2
| n6
| n9 ),
c_0_96 ).
cnf(c_0_105,negated_conjecture,
( ~ n10
| ~ n7
| n8 ),
c_0_97 ).
cnf(c_0_106,negated_conjecture,
( n2
| n7 ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_107,negated_conjecture,
( ~ n10
| ~ n6
| ~ n9
| ~ n2 ),
c_0_100 ).
cnf(c_0_108,negated_conjecture,
n10,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103]),c_0_95]) ).
cnf(c_0_109,negated_conjecture,
( ~ n2
| n9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_104]),c_0_95]) ).
cnf(c_0_110,negated_conjecture,
( ~ n10
| n2
| n8 ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_111,negated_conjecture,
( ~ n2
| ~ n6 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108])]),c_0_109]) ).
cnf(c_0_112,negated_conjecture,
( n2
| n8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_108])]) ).
cnf(c_0_113,negated_conjecture,
~ n2,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_102]),c_0_109]) ).
cnf(c_0_114,negated_conjecture,
( ~ p(s1(X1))
| ~ p(X1)
| n1(X1) ),
inference(fof_simplification,[status(thm)],[clause_25]) ).
cnf(c_0_115,negated_conjecture,
n8,
inference(sr,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_116,negated_conjecture,
( ~ p(s1(X1))
| ~ p(X1)
| n1(X1) ),
c_0_114 ).
cnf(c_0_117,negated_conjecture,
p(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_115])]) ).
cnf(c_0_118,negated_conjecture,
n1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_117]),c_0_117])]) ).
cnf(c_0_119,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_118])]),c_0_113]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN036-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.34 % Computer : n004.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 10:39:20 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.41 % Version: 3.5.1
% 0.13/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.13/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.41 % Starting sh5l with 300s (1) cores
% 0.13/0.41 % new_bool_3 with pid 2931768 completed with status 0
% 0.13/0.41 % Result found by new_bool_3
% 0.13/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.13/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.41 % Search class: FGHNF-FFSS11-SFFFFFNN
% 0.13/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.41 % SubtermCWHack with pid 2931774 completed with status 0
% 0.13/0.41 % Result found by SubtermCWHack
% 0.13/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.13/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.41 % Search class: FGHNF-FFSS11-SFFFFFNN
% 0.13/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.41 % Preprocessing time : 0.001 s
% 0.13/0.41
% 0.13/0.41 % Proof found!
% 0.13/0.41 % SZS status Unsatisfiable
% 0.13/0.41 % SZS output start CNFRefutation
% See solution above
% 0.13/0.41 % Parsed axioms : 36
% 0.13/0.41 % Removed by relevancy pruning/SinE : 0
% 0.13/0.41 % Initial clauses : 36
% 0.13/0.41 % Removed in clause preprocessing : 0
% 0.13/0.41 % Initial clauses in saturation : 36
% 0.13/0.41 % Processed clauses : 90
% 0.13/0.41 % ...of these trivial : 1
% 0.13/0.41 % ...subsumed : 15
% 0.13/0.41 % ...remaining for further processing : 74
% 0.13/0.41 % Other redundant clauses eliminated : 0
% 0.13/0.41 % Clauses deleted for lack of memory : 0
% 0.13/0.41 % Backward-subsumed : 21
% 0.13/0.41 % Backward-rewritten : 20
% 0.13/0.41 % Generated clauses : 104
% 0.13/0.41 % ...of the previous two non-redundant : 63
% 0.13/0.41 % ...aggressively subsumed : 0
% 0.13/0.41 % Contextual simplify-reflections : 12
% 0.13/0.41 % Paramodulations : 102
% 0.13/0.41 % Factorizations : 0
% 0.13/0.41 % NegExts : 0
% 0.13/0.41 % Equation resolutions : 0
% 0.13/0.41 % Disequality decompositions : 0
% 0.13/0.41 % Total rewrite steps : 25
% 0.13/0.41 % ...of those cached : 17
% 0.13/0.41 % Propositional unsat checks : 0
% 0.13/0.41 % Propositional check models : 0
% 0.13/0.41 % Propositional check unsatisfiable : 0
% 0.13/0.41 % Propositional clauses : 0
% 0.13/0.41 % Propositional clauses after purity: 0
% 0.13/0.41 % Propositional unsat core size : 0
% 0.13/0.41 % Propositional preprocessing time : 0.000
% 0.13/0.41 % Propositional encoding time : 0.000
% 0.13/0.41 % Propositional solver time : 0.000
% 0.13/0.41 % Success case prop preproc time : 0.000
% 0.13/0.41 % Success case prop encoding time : 0.000
% 0.13/0.41 % Success case prop solver time : 0.000
% 0.13/0.41 % Current number of processed clauses : 31
% 0.13/0.41 % Positive orientable unit clauses : 5
% 0.13/0.41 % Positive unorientable unit clauses: 0
% 0.13/0.41 % Negative unit clauses : 1
% 0.13/0.41 % Non-unit-clauses : 25
% 0.13/0.41 % Current number of unprocessed clauses: 7
% 0.13/0.41 % ...number of literals in the above : 25
% 0.13/0.41 % Current number of archived formulas : 0
% 0.13/0.41 % Current number of archived clauses : 43
% 0.13/0.41 % Clause-clause subsumption calls (NU) : 923
% 0.13/0.41 % Rec. Clause-clause subsumption calls : 728
% 0.13/0.41 % Non-unit clause-clause subsumptions : 41
% 0.13/0.41 % Unit Clause-clause subsumption calls : 73
% 0.13/0.41 % Rewrite failures with RHS unbound : 0
% 0.13/0.41 % BW rewrite match attempts : 8
% 0.13/0.41 % BW rewrite match successes : 8
% 0.13/0.41 % Condensation attempts : 0
% 0.13/0.41 % Condensation successes : 0
% 0.13/0.41 % Termbank termtop insertions : 1803
% 0.13/0.41 % Search garbage collected termcells : 71
% 0.13/0.41
% 0.13/0.41 % -------------------------------------------------
% 0.13/0.41 % User time : 0.002 s
% 0.13/0.41 % System time : 0.004 s
% 0.13/0.41 % Total time : 0.006 s
% 0.13/0.41 % Maximum resident set size: 3652 pages
% 0.13/0.41
% 0.13/0.41 % -------------------------------------------------
% 0.13/0.41 % User time : 0.004 s
% 0.13/0.41 % System time : 0.008 s
% 0.13/0.41 % Total time : 0.012 s
% 0.13/0.41 % Maximum resident set size: 4608 pages
% 0.13/0.41 % E exiting
%------------------------------------------------------------------------------