TSTP Solution File: HWV022-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : HWV022-2 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 17:55:14 EDT 2023
% Result : Unsatisfiable 0.37s 0.59s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of clauses : 58 ( 20 unt; 18 nHn; 53 RR)
% Number of literals : 134 ( 34 equ; 59 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 49 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_63,axiom,
( def_89(X1,X2)
| f_SUB_(X2,X1) = X3
| f_ADD_(X3,X1) != X2 ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_63) ).
cnf(quest_1,negated_conjecture,
f_ADD_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_,
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',quest_1) ).
cnf(axiom_65,axiom,
( p_LES_EQU_(X1,X2)
| ~ def_89(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_65) ).
cnf(axiom_66,axiom,
( p_LES_EQU_(X1,X2)
| ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1)) ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_66) ).
cnf(axiom_77,axiom,
f_ADD_(n0,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_77) ).
cnf(axiom_68,axiom,
( X1 = X2
| p_LES_EQU_(f_ADD_(X2,n1),X1)
| ~ p_LES_EQU_(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_68) ).
cnf(axiom_60,axiom,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_60) ).
cnf(axiom_22,axiom,
( p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_22) ).
cnf(axiom_5,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_5) ).
cnf(axiom_41,axiom,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_41) ).
cnf(axiom_13,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_13) ).
cnf(axiom_76,axiom,
( X1 = X2
| f_ADD_(X1,n1) != f_ADD_(X2,n1) ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_76) ).
cnf(axiom_25,axiom,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_25) ).
cnf(axiom_18,axiom,
( fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_ADD_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1)
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_18) ).
cnf(axiom_61,axiom,
( p_LES_EQU_(X1,n0)
| ~ p_LES_EQU_(X1,f_SUB_(X1,n1)) ),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',axiom_61) ).
cnf(quest_2,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',quest_2) ).
cnf(quest_3,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',quest_3) ).
cnf(quest_4,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',quest_4) ).
cnf(quest_5,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)) != fwork_DOTfifo_DOTrtl_DOTfifo__length_,
file('/export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p',quest_5) ).
cnf(c_0_19,axiom,
( def_89(X1,X2)
| f_SUB_(X2,X1) = X3
| f_ADD_(X3,X1) != X2 ),
axiom_63 ).
cnf(c_0_20,plain,
( f_SUB_(f_ADD_(X1,X2),X2) = X1
| def_89(X2,f_ADD_(X1,X2)) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_21,negated_conjecture,
f_ADD_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_,
quest_1 ).
cnf(c_0_22,axiom,
( p_LES_EQU_(X1,X2)
| ~ def_89(X2,X1) ),
axiom_65 ).
cnf(c_0_23,negated_conjecture,
( f_SUB_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1) = fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)
| def_89(n1,fwork_DOTfifo_DOTrtl_DOTfifo__length_) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
( p_LES_EQU_(X1,X2)
| ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1)) ),
axiom_66 ).
cnf(c_0_25,axiom,
f_ADD_(n0,X1) = X1,
axiom_77 ).
cnf(c_0_26,axiom,
( X1 = X2
| p_LES_EQU_(f_ADD_(X2,n1),X1)
| ~ p_LES_EQU_(X2,X1) ),
axiom_68 ).
cnf(c_0_27,negated_conjecture,
( f_SUB_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1) = fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
axiom_60 ).
cnf(c_0_29,axiom,
( p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
axiom_22 ).
cnf(c_0_30,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
axiom_5 ).
cnf(c_0_31,axiom,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
axiom_41 ).
cnf(c_0_32,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1)) ),
axiom_13 ).
cnf(c_0_33,axiom,
( X1 = X2
| f_ADD_(X1,n1) != f_ADD_(X2,n1) ),
axiom_76 ).
cnf(c_0_34,plain,
( p_LES_EQU_(X1,n0)
| ~ p_LES_EQU_(f_ADD_(X1,n1),n1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
( f_SUB_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1) = fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)
| fwork_DOTfifo_DOTrtl_DOTfifo__length_ = n1
| p_LES_EQU_(f_ADD_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1),n1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_37,plain,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1))) ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
inference(csr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
( X1 = n0
| f_ADD_(X1,n1) != n1 ),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_40,axiom,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
axiom_25 ).
cnf(c_0_41,axiom,
( fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_ADD_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1)
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
axiom_18 ).
cnf(c_0_42,axiom,
( p_LES_EQU_(X1,n0)
| ~ p_LES_EQU_(X1,f_SUB_(X1,n1)) ),
axiom_61 ).
cnf(c_0_43,negated_conjecture,
( f_SUB_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1) = fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)
| fwork_DOTfifo_DOTrtl_DOTfifo__length_ = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_44,plain,
( p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_37,c_0_38]),c_0_32]) ).
cnf(c_0_45,negated_conjecture,
( fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = n0
| fwork_DOTfifo_DOTrtl_DOTfifo__length_ != n1 ),
inference(spm,[status(thm)],[c_0_39,c_0_21]) ).
cnf(c_0_46,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
quest_2 ).
cnf(c_0_47,plain,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(X1)) ),
inference(rw,[status(thm)],[c_0_40,c_0_30]) ).
cnf(c_0_48,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
quest_3 ).
cnf(c_0_49,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
quest_4 ).
cnf(c_0_50,plain,
( fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(X1,n1)) = f_ADD_(fwork_DOTfifo_DOTrtl_DOTlevel_(X1),n1)
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_30]),c_0_30]),c_0_30]) ).
cnf(c_0_51,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)) != fwork_DOTfifo_DOTrtl_DOTfifo__length_,
quest_5 ).
cnf(c_0_52,negated_conjecture,
( fwork_DOTfifo_DOTrtl_DOTfifo__length_ = n1
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_36]) ).
cnf(c_0_53,negated_conjecture,
( fwork_DOTfifo_DOTrtl_DOTfifo__length_ != n1
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(t_206,n1))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),c_0_36]) ).
cnf(c_0_54,negated_conjecture,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(t_206,n1)))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_46]),c_0_48]),c_0_49]) ).
cnf(c_0_55,negated_conjecture,
p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_46]),c_0_21]),c_0_51]),c_0_48]),c_0_49]) ).
cnf(c_0_56,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(t_206,n1))),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_44]),c_0_46])]),c_0_53]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : HWV022-2 : TPTP v8.1.2. Released v2.5.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n029.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Oct 3 06:01:52 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.36/0.53 Running first-order model finding
% 0.36/0.53 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.tUMLwixa7R/E---3.1_26476.p
% 0.37/0.59 # Version: 3.1pre001
% 0.37/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.59 # Starting sh5l with 300s (1) cores
% 0.37/0.59 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 26553 completed with status 0
% 0.37/0.59 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.37/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.59 # No SInE strategy applied
% 0.37/0.59 # Search class: FGHSM-FSLS31-MFFFFFNN
% 0.37/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.59 # Starting G-E--_042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 784s (1) cores
% 0.37/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.37/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S06DI with 136s (1) cores
% 0.37/0.59 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 136s (1) cores
% 0.37/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.37/0.59 # G-E--_208_C18_F1_SE_CS_SP_PS_S06DI with pid 26562 completed with status 0
% 0.37/0.59 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S06DI
% 0.37/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.59 # No SInE strategy applied
% 0.37/0.59 # Search class: FGHSM-FSLS31-MFFFFFNN
% 0.37/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.59 # Starting G-E--_042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 784s (1) cores
% 0.37/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.37/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S06DI with 136s (1) cores
% 0.37/0.59 # Preprocessing time : 0.002 s
% 0.37/0.59 # Presaturation interreduction done
% 0.37/0.59
% 0.37/0.59 # Proof found!
% 0.37/0.59 # SZS status Unsatisfiable
% 0.37/0.59 # SZS output start CNFRefutation
% See solution above
% 0.37/0.59 # Parsed axioms : 138
% 0.37/0.59 # Removed by relevancy pruning/SinE : 0
% 0.37/0.59 # Initial clauses : 138
% 0.37/0.59 # Removed in clause preprocessing : 1
% 0.37/0.59 # Initial clauses in saturation : 137
% 0.37/0.59 # Processed clauses : 645
% 0.37/0.59 # ...of these trivial : 4
% 0.37/0.59 # ...subsumed : 188
% 0.37/0.59 # ...remaining for further processing : 453
% 0.37/0.59 # Other redundant clauses eliminated : 9
% 0.37/0.59 # Clauses deleted for lack of memory : 0
% 0.37/0.59 # Backward-subsumed : 31
% 0.37/0.59 # Backward-rewritten : 6
% 0.37/0.59 # Generated clauses : 805
% 0.37/0.59 # ...of the previous two non-redundant : 712
% 0.37/0.59 # ...aggressively subsumed : 0
% 0.37/0.59 # Contextual simplify-reflections : 32
% 0.37/0.59 # Paramodulations : 793
% 0.37/0.59 # Factorizations : 0
% 0.37/0.59 # NegExts : 0
% 0.37/0.59 # Equation resolutions : 10
% 0.37/0.59 # Total rewrite steps : 126
% 0.37/0.59 # Propositional unsat checks : 0
% 0.37/0.59 # Propositional check models : 0
% 0.37/0.59 # Propositional check unsatisfiable : 0
% 0.37/0.59 # Propositional clauses : 0
% 0.37/0.59 # Propositional clauses after purity: 0
% 0.37/0.59 # Propositional unsat core size : 0
% 0.37/0.59 # Propositional preprocessing time : 0.000
% 0.37/0.59 # Propositional encoding time : 0.000
% 0.37/0.59 # Propositional solver time : 0.000
% 0.37/0.59 # Success case prop preproc time : 0.000
% 0.37/0.59 # Success case prop encoding time : 0.000
% 0.37/0.59 # Success case prop solver time : 0.000
% 0.37/0.59 # Current number of processed clauses : 284
% 0.37/0.59 # Positive orientable unit clauses : 39
% 0.37/0.59 # Positive unorientable unit clauses: 0
% 0.37/0.59 # Negative unit clauses : 23
% 0.37/0.59 # Non-unit-clauses : 222
% 0.37/0.59 # Current number of unprocessed clauses: 325
% 0.37/0.59 # ...number of literals in the above : 883
% 0.37/0.59 # Current number of archived formulas : 0
% 0.37/0.59 # Current number of archived clauses : 165
% 0.37/0.59 # Clause-clause subsumption calls (NU) : 14816
% 0.37/0.59 # Rec. Clause-clause subsumption calls : 7455
% 0.37/0.59 # Non-unit clause-clause subsumptions : 172
% 0.37/0.59 # Unit Clause-clause subsumption calls : 439
% 0.37/0.59 # Rewrite failures with RHS unbound : 0
% 0.37/0.59 # BW rewrite match attempts : 23
% 0.37/0.59 # BW rewrite match successes : 6
% 0.37/0.59 # Condensation attempts : 0
% 0.37/0.59 # Condensation successes : 0
% 0.37/0.59 # Termbank termtop insertions : 15496
% 0.37/0.59
% 0.37/0.59 # -------------------------------------------------
% 0.37/0.59 # User time : 0.037 s
% 0.37/0.59 # System time : 0.007 s
% 0.37/0.59 # Total time : 0.043 s
% 0.37/0.59 # Maximum resident set size: 1968 pages
% 0.37/0.59
% 0.37/0.59 # -------------------------------------------------
% 0.37/0.59 # User time : 0.163 s
% 0.37/0.59 # System time : 0.016 s
% 0.37/0.59 # Total time : 0.179 s
% 0.37/0.59 # Maximum resident set size: 1780 pages
% 0.37/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------