%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET860-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 02:15:38 PM UTC 2026
% Result : Unsatisfiable 0.27s 0.59s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of clauses : 64 ( 10 unt; 17 nHn; 50 RR)
% Number of literals : 144 ( 4 equ; 72 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 169 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OComplD__dest_0,axiom,
( ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OComplD__dest_0) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).
cnf(cls_Set_OComplI_0,axiom,
( c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OComplI_0) ).
cnf(cls_Set_OCompl__subset__Compl__iff__iff1_0,axiom,
( ~ c_lessequals(c_uminus(X1,tc_set(X2)),c_uminus(X3,tc_set(X2)),tc_set(X2))
| c_lessequals(X3,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OCompl__subset__Compl__iff__iff1_0) ).
cnf(cls_Set_Osubset__antisym_0,axiom,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_Set_OsubsetD_0,axiom,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).
cnf(cls_Set_OCompl__subset__Compl__iff__iff2_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OCompl__subset__Compl__iff__iff2_0) ).
cnf(cls_Set_OUnionI_0,axiom,
( ~ c_in(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,c_Union(X4,X3),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnionI_0) ).
cnf(cls_Set_OUnionE_0,axiom,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnionE_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( ~ c_in(X1,v_C,tc_set(t_a))
| c_lessequals(X1,v_A,tc_set(t_a))
| c_lessequals(v_B,X1,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Set_OUnionE_1,axiom,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnionE_1) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_14,plain,
( ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OComplD__dest_0]) ).
cnf(c_0_15,plain,
( ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_16,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_17,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).
cnf(c_0_18,plain,
( ~ c_in(c_Main_OsubsetI__1(c_uminus(X1,tc_set(X2)),X3,X2),X1,X2)
| c_lessequals(c_uminus(X1,tc_set(X2)),X3,tc_set(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
( c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| c_in(X1,X2,X3) ),
cls_Set_OComplI_0 ).
cnf(c_0_20,plain,
( ~ c_lessequals(c_uminus(X1,tc_set(X2)),c_uminus(X3,tc_set(X2)),tc_set(X2))
| c_lessequals(X3,X1,tc_set(X2)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OCompl__subset__Compl__iff__iff1_0]) ).
cnf(c_0_21,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_17 ).
cnf(c_0_22,plain,
( c_lessequals(c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2)),X3,tc_set(X2))
| c_in(c_Main_OsubsetI__1(c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2)),X3,X2),X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).
cnf(c_0_24,plain,
( ~ c_lessequals(c_uminus(X1,tc_set(X2)),c_uminus(X3,tc_set(X2)),tc_set(X2))
| c_lessequals(X3,X1,tc_set(X2)) ),
c_0_20 ).
cnf(c_0_25,plain,
c_lessequals(c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2)),X1,tc_set(X2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_0_27,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OCompl__subset__Compl__iff__iff2_0]) ).
cnf(c_0_28,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_23 ).
cnf(c_0_29,plain,
c_lessequals(X1,c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2)),tc_set(X2)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
c_0_26 ).
cnf(c_0_31,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3)) ),
c_0_27 ).
cnf(c_0_32,plain,
( c_lessequals(X1,c_uminus(X2,tc_set(X3)),tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,c_uminus(X2,tc_set(X3)),X3),X2,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_33,plain,
c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25])]) ).
cnf(c_0_34,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,c_uminus(X4,tc_set(X3)),X3)
| c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),c_uminus(X2,tc_set(X3)),X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),c_uminus(X4,tc_set(X3)),X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
( ~ c_in(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,c_Union(X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionI_0]) ).
cnf(c_0_38,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionE_0]) ).
cnf(c_0_39,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X4,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_40,plain,
( ~ c_lessequals(X4,X1,tc_set(X2))
| c_lessequals(c_uminus(X1,tc_set(X2)),X3,tc_set(X2))
| c_in(c_Main_OsubsetI__1(c_uminus(X1,tc_set(X2)),X3,X2),c_uminus(X4,tc_set(X2)),X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_16]) ).
cnf(c_0_41,plain,
( ~ c_in(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,c_Union(X4,X3),X3) ),
c_0_37 ).
cnf(c_0_42,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3)) ),
c_0_38 ).
cnf(c_0_43,negated_conjecture,
( ~ c_in(X1,v_C,tc_set(t_a))
| c_lessequals(X1,v_A,tc_set(t_a))
| c_lessequals(v_B,X1,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_44,plain,
( ~ c_lessequals(X4,X1,tc_set(X2))
| ~ c_lessequals(c_uminus(X4,tc_set(X2)),X3,tc_set(X2))
| c_lessequals(c_uminus(X1,tc_set(X2)),X3,tc_set(X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
( ~ c_in(X4,c_Union(X2,X3),X3)
| ~ c_in(X1,c_Main_OUnionE__1(X4,X2,X3),X3)
| c_in(X1,c_Union(X2,X3),X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( ~ c_in(X1,v_C,tc_set(t_a))
| c_lessequals(X1,v_A,tc_set(t_a))
| c_lessequals(v_B,X1,tc_set(t_a)) ),
c_0_43 ).
cnf(c_0_47,plain,
( ~ c_lessequals(X4,X3,tc_set(X2))
| ~ c_lessequals(c_uminus(X4,tc_set(X2)),X1,tc_set(X2))
| c_lessequals(c_uminus(X1,tc_set(X2)),X3,tc_set(X2)) ),
inference(spm,[status(thm)],[c_0_44,c_0_33]) ).
cnf(c_0_48,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_lessequals(c_Main_OUnionE__1(X1,X2,X3),X4,tc_set(X3))
| c_in(c_Main_OsubsetI__1(c_Main_OUnionE__1(X1,X2,X3),X4,X3),c_Union(X2,X3),X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_16]) ).
cnf(c_0_49,negated_conjecture,
( ~ c_in(X1,c_Union(v_C,t_a),t_a)
| c_lessequals(v_B,c_Main_OUnionE__1(X1,v_C,t_a),tc_set(t_a))
| c_lessequals(c_Main_OUnionE__1(X1,v_C,t_a),v_A,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_46,c_0_42]) ).
cnf(c_0_50,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionE_1]) ).
cnf(c_0_51,plain,
( ~ c_lessequals(X1,X4,tc_set(X3))
| ~ c_lessequals(X4,X2,tc_set(X3))
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_31]),c_0_33]) ).
cnf(c_0_52,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_lessequals(c_Main_OUnionE__1(X1,X2,X3),c_Union(X2,X3),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( ~ c_in(X2,c_Union(v_C,t_a),t_a)
| ~ c_in(X1,c_Main_OUnionE__1(X2,v_C,t_a),t_a)
| c_lessequals(v_B,c_Main_OUnionE__1(X2,v_C,t_a),tc_set(t_a))
| c_in(X1,v_A,t_a) ),
inference(spm,[status(thm)],[c_0_30,c_0_49]) ).
cnf(c_0_54,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3) ),
c_0_50 ).
cnf(c_0_55,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_56,plain,
( ~ c_lessequals(X1,c_Main_OUnionE__1(X4,X2,X3),tc_set(X3))
| ~ c_in(X4,c_Union(X2,X3),X3)
| c_lessequals(X1,c_Union(X2,X3),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( ~ c_in(X1,c_Union(v_C,t_a),t_a)
| c_lessequals(v_B,c_Main_OUnionE__1(X1,v_C,t_a),tc_set(t_a))
| c_in(X1,v_A,t_a) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
c_0_55 ).
cnf(c_0_59,negated_conjecture,
( ~ c_in(X1,c_Union(v_C,t_a),t_a)
| c_in(X1,v_A,t_a) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_60,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_61,negated_conjecture,
( c_lessequals(c_Union(v_C,t_a),X1,tc_set(t_a))
| c_in(c_Main_OsubsetI__1(c_Union(v_C,t_a),X1,t_a),v_A,t_a) ),
inference(spm,[status(thm)],[c_0_59,c_0_16]) ).
cnf(c_0_62,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
c_0_60 ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_61]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET860-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n019.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 05:42:19 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.51 Running first-order theorem proving
% 0.27/0.51 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.27/0.59 % Version: 3.5.1
% 0.27/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.59 % Starting sh5l with 300s (1) cores
% 0.27/0.59 % new_bool_1 with pid 1801413 completed with status 9
% 0.27/0.59 % new_bool_3 with pid 1801412 completed with status 9
% 0.27/0.59 % sh5l with pid 1801414 completed with status 0
% 0.27/0.59 % Result found by sh5l
% 0.27/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.59 % Starting sh5l with 300s (1) cores
% 0.27/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.59 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.59 % Search class: FGHSF-FFSF32-SFFFFFNN
% 0.27/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.59 % SubtermCWHack with pid 1801420 completed with status 0
% 0.27/0.59 % Result found by SubtermCWHack
% 0.27/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.59 % Starting sh5l with 300s (1) cores
% 0.27/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.59 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.59 % Search class: FGHSF-FFSF32-SFFFFFNN
% 0.27/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.59 % Preprocessing time : 0.002 s
% 0.27/0.59
% 0.27/0.59 % Proof found!
% 0.27/0.59 % SZS status Unsatisfiable
% 0.27/0.59 % SZS output start CNFRefutation
% See solution above
% 0.27/0.59 % Parsed axioms : 24
% 0.27/0.59 % Removed by relevancy pruning/SinE : 10
% 0.27/0.59 % Initial clauses : 14
% 0.27/0.59 % Removed in clause preprocessing : 0
% 0.27/0.59 % Initial clauses in saturation : 14
% 0.27/0.59 % Processed clauses : 279
% 0.27/0.59 % ...of these trivial : 0
% 0.27/0.59 % ...subsumed : 147
% 0.27/0.59 % ...remaining for further processing : 132
% 0.27/0.59 % Other redundant clauses eliminated : 0
% 0.27/0.59 % Clauses deleted for lack of memory : 0
% 0.27/0.59 % Backward-subsumed : 3
% 0.27/0.59 % Backward-rewritten : 4
% 0.27/0.59 % Generated clauses : 1023
% 0.27/0.59 % ...of the previous two non-redundant : 999
% 0.27/0.59 % ...aggressively subsumed : 0
% 0.27/0.59 % Contextual simplify-reflections : 0
% 0.27/0.59 % Paramodulations : 1019
% 0.27/0.59 % Factorizations : 4
% 0.27/0.59 % NegExts : 0
% 0.27/0.59 % Equation resolutions : 0
% 0.27/0.59 % Disequality decompositions : 0
% 0.27/0.59 % Total rewrite steps : 174
% 0.27/0.59 % ...of those cached : 146
% 0.27/0.59 % Propositional unsat checks : 0
% 0.27/0.59 % Propositional check models : 0
% 0.27/0.59 % Propositional check unsatisfiable : 0
% 0.27/0.59 % Propositional clauses : 0
% 0.27/0.59 % Propositional clauses after purity: 0
% 0.27/0.59 % Propositional unsat core size : 0
% 0.27/0.59 % Propositional preprocessing time : 0.000
% 0.27/0.59 % Propositional encoding time : 0.000
% 0.27/0.59 % Propositional solver time : 0.000
% 0.27/0.59 % Success case prop preproc time : 0.000
% 0.27/0.59 % Success case prop encoding time : 0.000
% 0.27/0.59 % Success case prop solver time : 0.000
% 0.27/0.59 % Current number of processed clauses : 125
% 0.27/0.59 % Positive orientable unit clauses : 3
% 0.27/0.59 % Positive unorientable unit clauses: 0
% 0.27/0.59 % Negative unit clauses : 3
% 0.27/0.59 % Non-unit-clauses : 119
% 0.27/0.59 % Current number of unprocessed clauses: 722
% 0.27/0.59 % ...number of literals in the above : 2457
% 0.27/0.59 % Current number of archived formulas : 0
% 0.27/0.59 % Current number of archived clauses : 7
% 0.27/0.59 % Clause-clause subsumption calls (NU) : 1415
% 0.27/0.59 % Rec. Clause-clause subsumption calls : 1174
% 0.27/0.59 % Non-unit clause-clause subsumptions : 149
% 0.27/0.59 % Unit Clause-clause subsumption calls : 16
% 0.27/0.59 % Rewrite failures with RHS unbound : 0
% 0.27/0.59 % BW rewrite match attempts : 6
% 0.27/0.59 % BW rewrite match successes : 2
% 0.27/0.59 % Condensation attempts : 0
% 0.27/0.59 % Condensation successes : 0
% 0.27/0.59 % Termbank termtop insertions : 22515
% 0.27/0.59 % Search garbage collected termcells : 77
% 0.27/0.59
% 0.27/0.59 % -------------------------------------------------
% 0.27/0.59 % User time : 0.041 s
% 0.27/0.59 % System time : 0.008 s
% 0.27/0.59 % Total time : 0.049 s
% 0.27/0.59 % Maximum resident set size: 3648 pages
% 0.27/0.59
% 0.27/0.59 % -------------------------------------------------
% 0.27/0.59 % User time : 0.088 s
% 0.27/0.59 % System time : 0.047 s
% 0.27/0.59 % Total time : 0.135 s
% 0.27/0.59 % Maximum resident set size: 4864 pages
% 0.27/0.59 % E exiting
%------------------------------------------------------------------------------