TSTP Solution File: SWW368+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW368+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : Tue May 21 06:42:29 EDT 2024
% Result : Theorem 32.78s 4.97s
% Output : CNFRefutation 32.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 52 ( 32 unt; 0 def)
% Number of atoms : 85 ( 25 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 61 ( 28 ~; 23 |; 5 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-3 aty)
% Number of variables : 116 ( 15 sgn 63 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_Collect__empty__eq,axiom,
! [X42,X9] :
( hAPP(c_Set_OCollect(X9),X42) = c_Orderings_Obot__class_Obot(tc_fun(X9,tc_HOL_Obool))
<=> ! [X3] : ~ hBOOL(hAPP(X42,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_Collect__empty__eq) ).
fof(fact_Collect__def,axiom,
! [X42,X9] : hAPP(c_Set_OCollect(X9),X42) = X42,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_Collect__def) ).
fof(conj_5,hypothesis,
~ hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_5) ).
fof(help_c__COMBK__1,axiom,
! [X280,X279,X9,X25] : hAPP(hAPP(c_COMBK(X25,X9),X279),X280) = X279,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_c__COMBK__1) ).
fof(fact_Collect__mem__eq,axiom,
! [X11,X9] : hAPP(c_Set_OCollect(X9),hAPP(hAPP(c_COMBC(X9,tc_fun(X9,tc_HOL_Obool),tc_HOL_Obool),c_member(X9)),X11)) = X11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_Collect__mem__eq) ).
fof(fact_mem__def,axiom,
! [X11,X10,X9] :
( hBOOL(hAPP(hAPP(c_member(X9),X10),X11))
<=> hBOOL(hAPP(X11,X10)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_mem__def) ).
fof(help_c__COMBC__1,axiom,
! [X27,X41,X42,X9,X18,X7] : hAPP(hAPP(hAPP(c_COMBC(X7,X18,X9),X42),X41),X27) = hAPP(hAPP(X42,X27),X41),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_c__COMBC__1) ).
fof(conj_6,conjecture,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_6) ).
fof(fact_insert__subset,axiom,
! [X15,X11,X10,X9] :
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X9,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X9),X10),X11)),X15))
<=> ( hBOOL(hAPP(hAPP(c_member(X9),X10),X15))
& hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X9,tc_HOL_Obool)),X11),X15)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_insert__subset) ).
fof(fact_imageI,axiom,
! [X2,X7,X11,X10,X9] :
( hBOOL(hAPP(hAPP(c_member(X9),X10),X11))
=> hBOOL(hAPP(hAPP(c_member(X7),hAPP(X2,X10)),hAPP(c_Set_Oimage(X9,X7,X2),X11))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_imageI) ).
fof(conj_1,hypothesis,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),v_G),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
fof(conj_4,hypothesis,
hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),v_pn),v_U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_4) ).
fof(c_0_12,plain,
! [X42,X9] :
( hAPP(c_Set_OCollect(X9),X42) = c_Orderings_Obot__class_Obot(tc_fun(X9,tc_HOL_Obool))
<=> ! [X3] : ~ hBOOL(hAPP(X42,X3)) ),
inference(fof_simplification,[status(thm)],[fact_Collect__empty__eq]) ).
fof(c_0_13,plain,
! [X3530,X3531,X3532,X3533,X3535] :
( ( hAPP(c_Set_OCollect(X3531),X3530) != c_Orderings_Obot__class_Obot(tc_fun(X3531,tc_HOL_Obool))
| ~ hBOOL(hAPP(X3530,X3532)) )
& ( hBOOL(hAPP(X3533,esk127_1(X3533)))
| hAPP(c_Set_OCollect(X3535),X3533) = c_Orderings_Obot__class_Obot(tc_fun(X3535,tc_HOL_Obool)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])]) ).
fof(c_0_14,plain,
! [X3536,X3537] : hAPP(c_Set_OCollect(X3537),X3536) = X3536,
inference(variable_rename,[status(thm)],[fact_Collect__def]) ).
fof(c_0_15,hypothesis,
~ hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
inference(fof_simplification,[status(thm)],[conj_5]) ).
fof(c_0_16,plain,
! [X2991,X2992,X2993,X2994] : hAPP(hAPP(c_COMBK(X2994,X2993),X2992),X2991) = X2992,
inference(variable_rename,[status(thm)],[help_c__COMBK__1]) ).
cnf(c_0_17,plain,
( hBOOL(hAPP(X1,esk127_1(X1)))
| hAPP(c_Set_OCollect(X2),X1) = c_Orderings_Obot__class_Obot(tc_fun(X2,tc_HOL_Obool)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
hAPP(c_Set_OCollect(X1),X2) = X2,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X3547,X3548] : hAPP(c_Set_OCollect(X3548),hAPP(hAPP(c_COMBC(X3548,tc_fun(X3548,tc_HOL_Obool),tc_HOL_Obool),c_member(X3548)),X3547)) = X3547,
inference(variable_rename,[status(thm)],[fact_Collect__mem__eq]) ).
fof(c_0_20,hypothesis,
~ hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X1227,X1228,X1229] :
( ( ~ hBOOL(hAPP(hAPP(c_member(X1229),X1228),X1227))
| hBOOL(hAPP(X1227,X1228)) )
& ( ~ hBOOL(hAPP(X1227,X1228))
| hBOOL(hAPP(hAPP(c_member(X1229),X1228),X1227)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_mem__def])])]) ).
cnf(c_0_22,plain,
hAPP(hAPP(c_COMBK(X1,X2),X3),X4) = X3,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( X1 = c_Orderings_Obot__class_Obot(tc_fun(X2,tc_HOL_Obool))
| hBOOL(hAPP(X1,esk127_1(X1))) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_24,plain,
! [X3465,X3466,X3467,X3468,X3469,X3470] : hAPP(hAPP(hAPP(c_COMBC(X3470,X3469,X3468),X3467),X3466),X3465) = hAPP(hAPP(X3467,X3465),X3466),
inference(variable_rename,[status(thm)],[help_c__COMBC__1]) ).
cnf(c_0_25,plain,
hAPP(c_Set_OCollect(X1),hAPP(hAPP(c_COMBC(X1,tc_fun(X1,tc_HOL_Obool),tc_HOL_Obool),c_member(X1)),X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_6])]) ).
cnf(c_0_27,hypothesis,
~ hBOOL(hAPP(hAPP(c_member(t_a),hAPP(v_mgt__call,v_pn)),v_G)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( hBOOL(hAPP(hAPP(c_member(X3),X2),X1))
| ~ hBOOL(hAPP(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool)),X2) = X3
| hBOOL(X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_22]) ).
fof(c_0_30,plain,
! [X1286,X1287,X1288,X1289] :
( ( hBOOL(hAPP(hAPP(c_member(X1289),X1288),X1286))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1289,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1289),X1288),X1287)),X1286)) )
& ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1289,tc_HOL_Obool)),X1287),X1286))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1289,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1289),X1288),X1287)),X1286)) )
& ( ~ hBOOL(hAPP(hAPP(c_member(X1289),X1288),X1286))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1289,tc_HOL_Obool)),X1287),X1286))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1289,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1289),X1288),X1287)),X1286)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_insert__subset])])])]) ).
cnf(c_0_31,plain,
hAPP(hAPP(hAPP(c_COMBC(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),X5),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
hAPP(hAPP(c_COMBC(X1,tc_fun(X1,tc_HOL_Obool),tc_HOL_Obool),c_member(X1)),X2) = X2,
inference(rw,[status(thm)],[c_0_25,c_0_18]) ).
fof(c_0_33,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(fof_nnf,[status(thm)],[c_0_26]) ).
cnf(c_0_34,hypothesis,
~ hBOOL(hAPP(v_G,hAPP(v_mgt__call,v_pn))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( X1 = X2
| hBOOL(X1)
| hBOOL(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_29]) ).
cnf(c_0_36,plain,
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1),X2),X4)),X3))
| ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X4),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
hAPP(hAPP(c_member(X1),X2),X3) = hAPP(X3,X2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,hypothesis,
( X1 = hAPP(v_G,hAPP(v_mgt__call,v_pn))
| hBOOL(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_40,plain,
! [X358,X359,X360,X361,X362] :
( ~ hBOOL(hAPP(hAPP(c_member(X362),X361),X360))
| hBOOL(hAPP(hAPP(c_member(X359),hAPP(X358,X361)),hAPP(c_Set_Oimage(X362,X359,X358),X360))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_imageI])])]) ).
cnf(c_0_41,plain,
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(X1),X2),X3)),X4))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X1,tc_HOL_Obool)),X3),X4))
| ~ hBOOL(hAPP(X4,X2)) ),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),hAPP(hAPP(c_Set_Oinsert(t_a),hAPP(v_mgt__call,v_pn)),v_G)),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U)) = hAPP(v_G,hAPP(v_mgt__call,v_pn)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,hypothesis,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(t_a,tc_HOL_Obool)),v_G),hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U))),
inference(split_conjunct,[status(thm)],[conj_1]) ).
cnf(c_0_44,plain,
( hBOOL(hAPP(hAPP(c_member(X4),hAPP(X5,X2)),hAPP(c_Set_Oimage(X1,X4,X5),X3)))
| ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),hAPP(v_mgt__call,v_pn))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_34]) ).
cnf(c_0_46,plain,
( hBOOL(hAPP(X3,X2))
| ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_47,hypothesis,
hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),v_pn),v_U)),
inference(split_conjunct,[status(thm)],[conj_4]) ).
cnf(c_0_48,plain,
( hBOOL(hAPP(hAPP(c_Set_Oimage(X1,X2,X3),X4),hAPP(X3,X5)))
| ~ hBOOL(hAPP(X4,X5)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_37]),c_0_37]) ).
cnf(c_0_49,hypothesis,
hAPP(hAPP(c_Set_Oimage(tc_Com_Opname,t_a,v_mgt__call),v_U),hAPP(v_mgt__call,v_pn)) = hAPP(v_G,hAPP(v_mgt__call,v_pn)),
inference(spm,[status(thm)],[c_0_45,c_0_39]) ).
cnf(c_0_50,hypothesis,
hBOOL(hAPP(v_U,v_pn)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWW368+1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 20:49:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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
% 32.78/4.97 # Version: 3.1.0
% 32.78/4.97 # Preprocessing class: FMLMSMSMSSSNFFN.
% 32.78/4.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.78/4.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.78/4.97 # Starting new_bool_3 with 300s (1) cores
% 32.78/4.97 # Starting new_bool_1 with 300s (1) cores
% 32.78/4.97 # Starting sh5l with 300s (1) cores
% 32.78/4.97 # new_bool_1 with pid 5366 completed with status 0
% 32.78/4.97 # Result found by new_bool_1
% 32.78/4.97 # Preprocessing class: FMLMSMSMSSSNFFN.
% 32.78/4.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.78/4.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.78/4.97 # Starting new_bool_3 with 300s (1) cores
% 32.78/4.97 # Starting new_bool_1 with 300s (1) cores
% 32.78/4.97 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 32.78/4.97 # Search class: FGHSM-SMLM33-DFFFFFNN
% 32.78/4.97 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 32.78/4.97 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 32.78/4.97 # SAT001_MinMin_p005000_rr with pid 5369 completed with status 0
% 32.78/4.97 # Result found by SAT001_MinMin_p005000_rr
% 32.78/4.97 # Preprocessing class: FMLMSMSMSSSNFFN.
% 32.78/4.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.78/4.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.78/4.97 # Starting new_bool_3 with 300s (1) cores
% 32.78/4.97 # Starting new_bool_1 with 300s (1) cores
% 32.78/4.97 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 32.78/4.97 # Search class: FGHSM-SMLM33-DFFFFFNN
% 32.78/4.97 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 32.78/4.97 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 32.78/4.97 # Preprocessing time : 0.066 s
% 32.78/4.97 # Presaturation interreduction done
% 32.78/4.97
% 32.78/4.97 # Proof found!
% 32.78/4.97 # SZS status Theorem
% 32.78/4.97 # SZS output start CNFRefutation
% See solution above
% 32.78/4.97 # Parsed axioms : 5230
% 32.78/4.97 # Removed by relevancy pruning/SinE : 3454
% 32.78/4.97 # Initial clauses : 2701
% 32.78/4.97 # Removed in clause preprocessing : 70
% 32.78/4.97 # Initial clauses in saturation : 2631
% 32.78/4.97 # Processed clauses : 11952
% 32.78/4.97 # ...of these trivial : 434
% 32.78/4.97 # ...subsumed : 5757
% 32.78/4.97 # ...remaining for further processing : 5761
% 32.78/4.97 # Other redundant clauses eliminated : 4101
% 32.78/4.97 # Clauses deleted for lack of memory : 0
% 32.78/4.97 # Backward-subsumed : 257
% 32.78/4.97 # Backward-rewritten : 277
% 32.78/4.97 # Generated clauses : 207247
% 32.78/4.97 # ...of the previous two non-redundant : 194550
% 32.78/4.97 # ...aggressively subsumed : 0
% 32.78/4.97 # Contextual simplify-reflections : 31
% 32.78/4.97 # Paramodulations : 203085
% 32.78/4.97 # Factorizations : 17
% 32.78/4.97 # NegExts : 0
% 32.78/4.97 # Equation resolutions : 4166
% 32.78/4.97 # Disequality decompositions : 0
% 32.78/4.97 # Total rewrite steps : 33439
% 32.78/4.97 # ...of those cached : 26044
% 32.78/4.97 # Propositional unsat checks : 1
% 32.78/4.97 # Propositional check models : 0
% 32.78/4.97 # Propositional check unsatisfiable : 0
% 32.78/4.97 # Propositional clauses : 0
% 32.78/4.97 # Propositional clauses after purity: 0
% 32.78/4.97 # Propositional unsat core size : 0
% 32.78/4.97 # Propositional preprocessing time : 0.000
% 32.78/4.97 # Propositional encoding time : 0.231
% 32.78/4.97 # Propositional solver time : 0.093
% 32.78/4.97 # Success case prop preproc time : 0.000
% 32.78/4.97 # Success case prop encoding time : 0.000
% 32.78/4.97 # Success case prop solver time : 0.000
% 32.78/4.97 # Current number of processed clauses : 3056
% 32.78/4.97 # Positive orientable unit clauses : 656
% 32.78/4.97 # Positive unorientable unit clauses: 48
% 32.78/4.97 # Negative unit clauses : 345
% 32.78/4.97 # Non-unit-clauses : 2007
% 32.78/4.97 # Current number of unprocessed clauses: 165235
% 32.78/4.97 # ...number of literals in the above : 464773
% 32.78/4.97 # Current number of archived formulas : 0
% 32.78/4.97 # Current number of archived clauses : 2499
% 32.78/4.97 # Clause-clause subsumption calls (NU) : 1058850
% 32.78/4.97 # Rec. Clause-clause subsumption calls : 557179
% 32.78/4.97 # Non-unit clause-clause subsumptions : 4013
% 32.78/4.97 # Unit Clause-clause subsumption calls : 40850
% 32.78/4.97 # Rewrite failures with RHS unbound : 172
% 32.78/4.97 # BW rewrite match attempts : 14034
% 32.78/4.97 # BW rewrite match successes : 742
% 32.78/4.97 # Condensation attempts : 0
% 32.78/4.97 # Condensation successes : 0
% 32.78/4.97 # Termbank termtop insertions : 5739722
% 32.78/4.97 # Search garbage collected termcells : 68338
% 32.78/4.97
% 32.78/4.97 # -------------------------------------------------
% 32.78/4.97 # User time : 4.009 s
% 32.78/4.97 # System time : 0.178 s
% 32.78/4.97 # Total time : 4.187 s
% 32.78/4.97 # Maximum resident set size: 17224 pages
% 32.78/4.97
% 32.78/4.97 # -------------------------------------------------
% 32.78/4.97 # User time : 4.189 s
% 32.78/4.97 # System time : 0.191 s
% 32.78/4.97 # Total time : 4.380 s
% 32.78/4.97 # Maximum resident set size: 9424 pages
% 32.78/4.97 % E---3.1 exiting
% 32.78/4.98 % E exiting
%------------------------------------------------------------------------------