TSTP Solution File: SWV693-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV693-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:55:08 EDT 2023
% Result : Unsatisfiable 3.98s 1.32s
% Output : CNFRefutation 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 24 ( 17 unt; 0 nHn; 16 RR)
% Number of literals : 35 ( 11 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 7 con; 0-5 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_SetInterval_Oord__class_OatLeastLessThan(v_i,v_n,tc_nat)) != hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_i,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_i,v_n,tc_nat),tc_fun(tc_nat,tc_bool))),
file('/export/starexec/sandbox/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p',cls_conjecture_0) ).
cnf(cls_Un__commute_0,axiom,
c_Lattices_Oupper__semilattice__class_Osup(X1,X2,tc_fun(X3,tc_bool)) = c_Lattices_Oupper__semilattice__class_Osup(X2,X1,tc_fun(X3,tc_bool)),
file('/export/starexec/sandbox/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p',cls_Un__commute_0) ).
cnf(cls_atLeastSucLessThan__greaterThanLessThan_0,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(hAPP(c_Suc,X1),X2,tc_nat) = c_SetInterval_Oord__class_OgreaterThanLessThan(X1,X2,tc_nat),
file('/export/starexec/sandbox/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p',cls_atLeastSucLessThan__greaterThanLessThan_0) ).
cnf(cls_atLeastLessThan__singleton_0,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(X1,hAPP(c_Suc,X1),tc_nat) = c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),
file('/export/starexec/sandbox/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p',cls_atLeastLessThan__singleton_0) ).
cnf(cls_ivl__disj__un_I17_J_0,axiom,
( c_Lattices_Oupper__semilattice__class_Osup(c_SetInterval_Oord__class_OatLeastLessThan(X2,X3,X1),c_SetInterval_Oord__class_OatLeastLessThan(X3,X4,X1),tc_fun(X1,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(X2,X4,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ hBOOL(hAPP(c_lessequals(X3,X1),X4))
| ~ hBOOL(hAPP(c_lessequals(X2,X1),X3)) ),
file('/export/starexec/sandbox/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p',cls_ivl__disj__un_I17_J_0) ).
cnf(clsarity_nat__Orderings_Olinorder,axiom,
class_Orderings_Olinorder(tc_nat),
file('/export/starexec/sandbox/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p',clsarity_nat__Orderings_Olinorder) ).
cnf(cls_Suc__leI_0,axiom,
( hBOOL(hAPP(c_lessequals(hAPP(c_Suc,X1),tc_nat),X2))
| ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X1,tc_nat),X2)) ),
file('/export/starexec/sandbox/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p',cls_Suc__leI_0) ).
cnf(cls_assms_0,axiom,
hBOOL(hAPP(c_HOL_Oord__class_Oless(v_i,tc_nat),v_n)),
file('/export/starexec/sandbox/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p',cls_assms_0) ).
cnf(cls_nat__less__le_0,axiom,
( hBOOL(hAPP(c_lessequals(X1,tc_nat),X2))
| ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X1,tc_nat),X2)) ),
file('/export/starexec/sandbox/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p',cls_nat__less__le_0) ).
cnf(cls_lessI_0,axiom,
hBOOL(hAPP(c_HOL_Oord__class_Oless(X1,tc_nat),hAPP(c_Suc,X1))),
file('/export/starexec/sandbox/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p',cls_lessI_0) ).
cnf(c_0_10,negated_conjecture,
hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_SetInterval_Oord__class_OatLeastLessThan(v_i,v_n,tc_nat)) != hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_i,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_i,v_n,tc_nat),tc_fun(tc_nat,tc_bool))),
cls_conjecture_0 ).
cnf(c_0_11,axiom,
c_Lattices_Oupper__semilattice__class_Osup(X1,X2,tc_fun(X3,tc_bool)) = c_Lattices_Oupper__semilattice__class_Osup(X2,X1,tc_fun(X3,tc_bool)),
cls_Un__commute_0 ).
cnf(c_0_12,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(hAPP(c_Suc,X1),X2,tc_nat) = c_SetInterval_Oord__class_OgreaterThanLessThan(X1,X2,tc_nat),
cls_atLeastSucLessThan__greaterThanLessThan_0 ).
cnf(c_0_13,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(X1,hAPP(c_Suc,X1),tc_nat) = c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),
cls_atLeastLessThan__singleton_0 ).
cnf(c_0_14,negated_conjecture,
hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_Lattices_Oupper__semilattice__class_Osup(c_SetInterval_Oord__class_OatLeastLessThan(v_i,hAPP(c_Suc,v_i),tc_nat),c_SetInterval_Oord__class_OatLeastLessThan(hAPP(c_Suc,v_i),v_n,tc_nat),tc_fun(tc_nat,tc_bool))) != hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_SetInterval_Oord__class_OatLeastLessThan(v_i,v_n,tc_nat)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_11]) ).
cnf(c_0_15,axiom,
( c_Lattices_Oupper__semilattice__class_Osup(c_SetInterval_Oord__class_OatLeastLessThan(X2,X3,X1),c_SetInterval_Oord__class_OatLeastLessThan(X3,X4,X1),tc_fun(X1,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(X2,X4,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ hBOOL(hAPP(c_lessequals(X3,X1),X4))
| ~ hBOOL(hAPP(c_lessequals(X2,X1),X3)) ),
cls_ivl__disj__un_I17_J_0 ).
cnf(c_0_16,axiom,
class_Orderings_Olinorder(tc_nat),
clsarity_nat__Orderings_Olinorder ).
cnf(c_0_17,negated_conjecture,
( ~ hBOOL(hAPP(c_lessequals(hAPP(c_Suc,v_i),tc_nat),v_n))
| ~ hBOOL(hAPP(c_lessequals(v_i,tc_nat),hAPP(c_Suc,v_i))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_18,axiom,
( hBOOL(hAPP(c_lessequals(hAPP(c_Suc,X1),tc_nat),X2))
| ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X1,tc_nat),X2)) ),
cls_Suc__leI_0 ).
cnf(c_0_19,axiom,
hBOOL(hAPP(c_HOL_Oord__class_Oless(v_i,tc_nat),v_n)),
cls_assms_0 ).
cnf(c_0_20,negated_conjecture,
~ hBOOL(hAPP(c_lessequals(v_i,tc_nat),hAPP(c_Suc,v_i))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_21,axiom,
( hBOOL(hAPP(c_lessequals(X1,tc_nat),X2))
| ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X1,tc_nat),X2)) ),
cls_nat__less__le_0 ).
cnf(c_0_22,axiom,
hBOOL(hAPP(c_HOL_Oord__class_Oless(X1,tc_nat),hAPP(c_Suc,X1))),
cls_lessI_0 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.29 % Problem : SWV693-1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.30 % Command : run_E %s %d THM
% 0.29/0.50 % Computer : n031.cluster.edu
% 0.29/0.50 % Model : x86_64 x86_64
% 0.29/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.29/0.50 % Memory : 8042.1875MB
% 0.29/0.50 % OS : Linux 3.10.0-693.el7.x86_64
% 0.29/0.51 % CPULimit : 2400
% 0.29/0.51 % WCLimit : 300
% 0.29/0.51 % DateTime : Tue Oct 3 05:09:44 EDT 2023
% 0.29/0.51 % CPUTime :
% 0.35/0.79 Running first-order theorem proving
% 0.35/0.79 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/tmp/tmp.MD7DlaPGQK/E---3.1_20177.p
% 3.98/1.32 # Version: 3.1pre001
% 3.98/1.32 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.98/1.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.98/1.32 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.98/1.32 # Starting new_bool_3 with 300s (1) cores
% 3.98/1.32 # Starting new_bool_1 with 300s (1) cores
% 3.98/1.32 # Starting sh5l with 300s (1) cores
% 3.98/1.32 # new_bool_1 with pid 20437 completed with status 0
% 3.98/1.32 # Result found by new_bool_1
% 3.98/1.32 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.98/1.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.98/1.32 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.98/1.32 # Starting new_bool_3 with 300s (1) cores
% 3.98/1.32 # Starting new_bool_1 with 300s (1) cores
% 3.98/1.32 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.98/1.32 # Search class: FGHSM-FSLM32-DFFFFFNN
% 3.98/1.32 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.98/1.32 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 3.98/1.32 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 20448 completed with status 0
% 3.98/1.32 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 3.98/1.32 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.98/1.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.98/1.32 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.98/1.32 # Starting new_bool_3 with 300s (1) cores
% 3.98/1.32 # Starting new_bool_1 with 300s (1) cores
% 3.98/1.32 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.98/1.32 # Search class: FGHSM-FSLM32-DFFFFFNN
% 3.98/1.32 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.98/1.32 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 3.98/1.32 # Preprocessing time : 0.105 s
% 3.98/1.32
% 3.98/1.32 # Proof found!
% 3.98/1.32 # SZS status Unsatisfiable
% 3.98/1.32 # SZS output start CNFRefutation
% See solution above
% 3.98/1.32 # Parsed axioms : 1471
% 3.98/1.32 # Removed by relevancy pruning/SinE : 682
% 3.98/1.32 # Initial clauses : 789
% 3.98/1.32 # Removed in clause preprocessing : 0
% 3.98/1.32 # Initial clauses in saturation : 789
% 3.98/1.32 # Processed clauses : 872
% 3.98/1.32 # ...of these trivial : 30
% 3.98/1.32 # ...subsumed : 271
% 3.98/1.32 # ...remaining for further processing : 571
% 3.98/1.32 # Other redundant clauses eliminated : 2
% 3.98/1.32 # Clauses deleted for lack of memory : 0
% 3.98/1.32 # Backward-subsumed : 4
% 3.98/1.32 # Backward-rewritten : 7
% 3.98/1.32 # Generated clauses : 15876
% 3.98/1.32 # ...of the previous two non-redundant : 14629
% 3.98/1.32 # ...aggressively subsumed : 0
% 3.98/1.32 # Contextual simplify-reflections : 1
% 3.98/1.32 # Paramodulations : 15856
% 3.98/1.32 # Factorizations : 4
% 3.98/1.32 # NegExts : 0
% 3.98/1.32 # Equation resolutions : 16
% 3.98/1.32 # Total rewrite steps : 7203
% 3.98/1.32 # Propositional unsat checks : 0
% 3.98/1.32 # Propositional check models : 0
% 3.98/1.32 # Propositional check unsatisfiable : 0
% 3.98/1.32 # Propositional clauses : 0
% 3.98/1.32 # Propositional clauses after purity: 0
% 3.98/1.32 # Propositional unsat core size : 0
% 3.98/1.32 # Propositional preprocessing time : 0.000
% 3.98/1.32 # Propositional encoding time : 0.000
% 3.98/1.32 # Propositional solver time : 0.000
% 3.98/1.32 # Success case prop preproc time : 0.000
% 3.98/1.32 # Success case prop encoding time : 0.000
% 3.98/1.32 # Success case prop solver time : 0.000
% 3.98/1.32 # Current number of processed clauses : 560
% 3.98/1.32 # Positive orientable unit clauses : 100
% 3.98/1.32 # Positive unorientable unit clauses: 12
% 3.98/1.32 # Negative unit clauses : 16
% 3.98/1.32 # Non-unit-clauses : 432
% 3.98/1.32 # Current number of unprocessed clauses: 14542
% 3.98/1.32 # ...number of literals in the above : 55420
% 3.98/1.32 # Current number of archived formulas : 0
% 3.98/1.32 # Current number of archived clauses : 11
% 3.98/1.32 # Clause-clause subsumption calls (NU) : 40487
% 3.98/1.32 # Rec. Clause-clause subsumption calls : 13411
% 3.98/1.32 # Non-unit clause-clause subsumptions : 224
% 3.98/1.32 # Unit Clause-clause subsumption calls : 833
% 3.98/1.32 # Rewrite failures with RHS unbound : 26
% 3.98/1.32 # BW rewrite match attempts : 329
% 3.98/1.32 # BW rewrite match successes : 60
% 3.98/1.32 # Condensation attempts : 0
% 3.98/1.32 # Condensation successes : 0
% 3.98/1.32 # Termbank termtop insertions : 556358
% 3.98/1.32
% 3.98/1.32 # -------------------------------------------------
% 3.98/1.32 # User time : 0.442 s
% 3.98/1.32 # System time : 0.018 s
% 3.98/1.32 # Total time : 0.460 s
% 3.98/1.32 # Maximum resident set size: 3984 pages
% 3.98/1.32
% 3.98/1.32 # -------------------------------------------------
% 3.98/1.32 # User time : 0.496 s
% 3.98/1.32 # System time : 0.021 s
% 3.98/1.32 # Total time : 0.517 s
% 3.98/1.32 # Maximum resident set size: 2920 pages
% 3.98/1.32 % E---3.1 exiting
% 3.98/1.32 % E---3.1 exiting
%------------------------------------------------------------------------------