TSTP Solution File: COM140+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COM140+1 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : Mon May 20 19:08:32 EDT 2024
% Result : Theorem 10.75s 1.83s
% Output : CNFRefutation 10.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 62 ( 17 unt; 0 def)
% Number of atoms : 183 ( 88 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 194 ( 73 ~; 77 |; 23 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 208 ( 17 sgn 111 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('T-Weak-abs-2',conjecture,
! [X9,X10,X20,X21,X36,X15] :
( ( X9 = X21
& vlookup(X9,X20) = vnoType
& vtcheck(X20,vabs(X21,X36,veabs),X15) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X36,veabs),X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','T-Weak-abs-2') ).
fof('T-Weak-abs-1-gen',axiom,
! [X9,X10,X20,X21,X36,X12,X15] :
( ( X9 != X21
& vlookup(X9,X20) = vnoType
& vtcheck(X20,vabs(X21,X36,X12),X15) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X36,X12),X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','T-Weak-abs-1-gen') ).
fof('alpha-equiv-typing',axiom,
! [X11,X20,X12,X15] :
( ( vtcheck(X20,X11,X15)
& valphaEquivalent(X11,X12) )
=> vtcheck(X20,X12,X15) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COM001+1.ax','alpha-equiv-typing') ).
fof('alpha-equiv-subst-abs',axiom,
! [X10,X9,X21,X11] :
( ~ visFreeVar(X21,X11)
=> valphaEquivalent(vabs(X9,X10,X11),vabs(X21,X10,vsubst(X9,vvar(X21),X11))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COM001+1.ax','alpha-equiv-subst-abs') ).
fof('alpha-equiv-sym',axiom,
! [X13,X12] :
( valphaEquivalent(X12,X13)
=> valphaEquivalent(X13,X12) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COM001+1.ax','alpha-equiv-sym') ).
fof('gensym-is-fresh',axiom,
! [X14,X11] :
( vgensym(X11) = X14
=> ~ visFreeVar(X14,X11) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COM001+0.ax','gensym-is-fresh') ).
fof(isFreeVar2,axiom,
! [X1,X4,X12,X14,X13] :
( ( X1 = X14
& X4 = vapp(X12,X13) )
=> ( ( ( visFreeVar(X14,X12)
| visFreeVar(X14,X13) )
=> visFreeVar(X1,X4) )
& ( visFreeVar(X1,X4)
=> ( visFreeVar(X14,X12)
| visFreeVar(X14,X13) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COM001+0.ax',isFreeVar2) ).
fof(isFreeVar0,axiom,
! [X1,X4,X9,X14] :
( ( X1 = X14
& X4 = vvar(X9) )
=> ( ( X9 = X14
=> visFreeVar(X1,X4) )
& ( visFreeVar(X1,X4)
=> X9 = X14 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COM001+0.ax',isFreeVar0) ).
fof(subst2,axiom,
! [X1,X4,X6,X19,X12,X9,X11,X13] :
( ( X1 = X9
& X4 = X11
& X6 = vapp(X12,X13) )
=> ( X19 = vsubst(X1,X4,X6)
=> X19 = vapp(vsubst(X9,X11,X12),vsubst(X9,X11,X13)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COM001+0.ax',subst2) ).
fof(subst0,axiom,
! [X9,X21,X1,X4,X6,X19,X11] :
( ( X1 = X9
& X4 = X11
& X6 = vvar(X21) )
=> ( X9 = X21
=> ( X19 = vsubst(X1,X4,X6)
=> X19 = X11 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COM001+0.ax',subst0) ).
fof(c_0_10,negated_conjecture,
~ ! [X9,X10,X20,X21,X36,X15] :
( ( X9 = X21
& vlookup(X9,X20) = vnoType
& vtcheck(X20,vabs(X21,X36,veabs),X15) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X36,veabs),X15) ),
inference(assume_negation,[status(cth)],['T-Weak-abs-2']) ).
fof(c_0_11,negated_conjecture,
( esk32_0 = esk35_0
& vlookup(esk32_0,esk34_0) = vnoType
& vtcheck(esk34_0,vabs(esk35_0,esk36_0,veabs),esk37_0)
& ~ vtcheck(vbind(esk32_0,esk33_0,esk34_0),vabs(esk35_0,esk36_0,veabs),esk37_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_12,plain,
! [X9,X10,X20,X21,X36,X12,X15] :
( ( X9 != X21
& vlookup(X9,X20) = vnoType
& vtcheck(X20,vabs(X21,X36,X12),X15) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X36,X12),X15) ),
inference(fof_simplification,[status(thm)],['T-Weak-abs-1-gen']) ).
fof(c_0_13,plain,
! [X308,X309,X310,X311] :
( ~ vtcheck(X309,X308,X311)
| ~ valphaEquivalent(X308,X310)
| vtcheck(X309,X310,X311) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['alpha-equiv-typing'])])]) ).
cnf(c_0_14,negated_conjecture,
vtcheck(esk34_0,vabs(esk35_0,esk36_0,veabs),esk37_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
esk32_0 = esk35_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X10,X9,X21,X11] :
( ~ visFreeVar(X21,X11)
=> valphaEquivalent(vabs(X9,X10,X11),vabs(X21,X10,vsubst(X9,vvar(X21),X11))) ),
inference(fof_simplification,[status(thm)],['alpha-equiv-subst-abs']) ).
fof(c_0_17,plain,
! [X315,X316,X317,X318,X319,X320,X321] :
( X315 = X318
| vlookup(X315,X317) != vnoType
| ~ vtcheck(X317,vabs(X318,X319,X320),X321)
| vtcheck(vbind(X315,X316,X317),vabs(X318,X319,X320),X321) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_18,plain,
( vtcheck(X1,X4,X3)
| ~ vtcheck(X1,X2,X3)
| ~ valphaEquivalent(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
vtcheck(esk34_0,vabs(esk32_0,esk36_0,veabs),esk37_0),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_20,plain,
! [X304,X305,X306,X307] :
( visFreeVar(X306,X307)
| valphaEquivalent(vabs(X305,X304,X307),vabs(X306,X304,vsubst(X305,vvar(X306),X307))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).
cnf(c_0_21,plain,
( X1 = X2
| vtcheck(vbind(X1,X7,X3),vabs(X2,X4,X5),X6)
| vlookup(X1,X3) != vnoType
| ~ vtcheck(X3,vabs(X2,X4,X5),X6) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
vlookup(esk32_0,esk34_0) = vnoType,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( vtcheck(esk34_0,X1,esk37_0)
| ~ valphaEquivalent(vabs(esk32_0,esk36_0,veabs),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( visFreeVar(X1,X2)
| valphaEquivalent(vabs(X3,X4,X2),vabs(X1,X4,vsubst(X3,vvar(X1),X2))) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( esk32_0 = X1
| vtcheck(vbind(esk32_0,X2,esk34_0),vabs(X1,X3,X4),X5)
| ~ vtcheck(esk34_0,vabs(X1,X3,X4),X5) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( vtcheck(esk34_0,vabs(X1,esk36_0,vsubst(esk32_0,vvar(X1),veabs)),esk37_0)
| visFreeVar(X1,veabs) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_27,plain,
! [X299,X300] :
( ~ valphaEquivalent(X300,X299)
| valphaEquivalent(X299,X300) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['alpha-equiv-sym'])])]) ).
cnf(c_0_28,negated_conjecture,
( esk32_0 = X1
| vtcheck(vbind(esk32_0,X2,esk34_0),vabs(X1,esk36_0,vsubst(esk32_0,vvar(X1),veabs)),esk37_0)
| visFreeVar(X1,veabs) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( valphaEquivalent(X2,X1)
| ~ valphaEquivalent(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_30,plain,
! [X14,X11] :
( vgensym(X11) = X14
=> ~ visFreeVar(X14,X11) ),
inference(fof_simplification,[status(thm)],['gensym-is-fresh']) ).
fof(c_0_31,plain,
! [X80,X81,X82,X83,X84] :
( ( ~ visFreeVar(X83,X82)
| visFreeVar(X80,X81)
| X80 != X83
| X81 != vapp(X82,X84) )
& ( ~ visFreeVar(X83,X84)
| visFreeVar(X80,X81)
| X80 != X83
| X81 != vapp(X82,X84) )
& ( ~ visFreeVar(X80,X81)
| visFreeVar(X83,X82)
| visFreeVar(X83,X84)
| X80 != X83
| X81 != vapp(X82,X84) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar2])])])]) ).
cnf(c_0_32,negated_conjecture,
~ vtcheck(vbind(esk32_0,esk33_0,esk34_0),vabs(esk35_0,esk36_0,veabs),esk37_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,negated_conjecture,
( esk32_0 = X1
| vtcheck(vbind(esk32_0,X2,esk34_0),X3,esk37_0)
| visFreeVar(X1,veabs)
| ~ valphaEquivalent(vabs(X1,esk36_0,vsubst(esk32_0,vvar(X1),veabs)),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_34,plain,
( valphaEquivalent(vabs(X1,X2,vsubst(X3,vvar(X1),X4)),vabs(X3,X2,X4))
| visFreeVar(X1,X4) ),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
fof(c_0_35,plain,
! [X70,X71,X72,X73] :
( ( X72 != X73
| visFreeVar(X70,X71)
| X70 != X73
| X71 != vvar(X72) )
& ( ~ visFreeVar(X70,X71)
| X72 = X73
| X70 != X73
| X71 != vvar(X72) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar0])])])]) ).
fof(c_0_36,plain,
! [X147,X148] :
( vgensym(X148) != X147
| ~ visFreeVar(X147,X148) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
cnf(c_0_37,plain,
( visFreeVar(X3,X4)
| ~ visFreeVar(X1,X2)
| X3 != X1
| X4 != vapp(X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
~ vtcheck(vbind(esk32_0,esk33_0,esk34_0),vabs(esk32_0,esk36_0,veabs),esk37_0),
inference(rw,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_39,negated_conjecture,
( esk32_0 = X1
| vtcheck(vbind(esk32_0,X2,esk34_0),vabs(esk32_0,esk36_0,veabs),esk37_0)
| visFreeVar(X1,veabs) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
( visFreeVar(X3,X4)
| ~ visFreeVar(X1,X2)
| X3 != X1
| X4 != vapp(X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
( visFreeVar(X3,X4)
| X1 != X2
| X3 != X2
| X4 != vvar(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_42,plain,
! [X163,X164,X165,X166,X167,X168,X169,X170] :
( X163 != X168
| X164 != X169
| X165 != vapp(X167,X170)
| X166 != vsubst(X163,X164,X165)
| X166 = vapp(vsubst(X168,X169,X167),vsubst(X168,X169,X170)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subst2])])]) ).
fof(c_0_43,plain,
! [X149,X150,X151,X152,X153,X154,X155] :
( X151 != X149
| X152 != X155
| X153 != vvar(X150)
| X149 != X150
| X154 != vsubst(X151,X152,X153)
| X154 = X155 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subst0])])]) ).
cnf(c_0_44,plain,
( vgensym(X1) != X2
| ~ visFreeVar(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
( visFreeVar(X1,vapp(X2,X3))
| ~ visFreeVar(X1,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])]) ).
cnf(c_0_46,negated_conjecture,
( esk32_0 = X1
| visFreeVar(X1,veabs) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,plain,
( visFreeVar(X1,vapp(X2,X3))
| ~ visFreeVar(X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_40])]) ).
cnf(c_0_48,plain,
visFreeVar(X1,vvar(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_41])])]) ).
cnf(c_0_49,plain,
( X8 = vapp(vsubst(X2,X4,X6),vsubst(X2,X4,X7))
| X1 != X2
| X3 != X4
| X5 != vapp(X6,X7)
| X8 != vsubst(X1,X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
( X7 = X4
| X1 != X2
| X3 != X4
| X5 != vvar(X6)
| X2 != X6
| X7 != vsubst(X1,X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
~ visFreeVar(vgensym(X1),X1),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_52,negated_conjecture,
( esk32_0 = X1
| visFreeVar(X1,vapp(veabs,X2)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,plain,
visFreeVar(X1,vapp(X2,vvar(X1))),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
vapp(vsubst(X1,X2,X3),vsubst(X1,X2,X4)) = vsubst(X1,X2,vapp(X3,X4)),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_49])])])]) ).
cnf(c_0_55,plain,
vsubst(X1,X2,vvar(X1)) = X2,
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_50])])])])]) ).
cnf(c_0_56,negated_conjecture,
vgensym(vapp(veabs,X1)) = esk32_0,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
visFreeVar(X1,vapp(X2,vapp(X3,vvar(X1)))),
inference(spm,[status(thm)],[c_0_47,c_0_53]) ).
cnf(c_0_58,plain,
vapp(vsubst(X1,X2,X3),X2) = vsubst(X1,X2,vapp(X3,vvar(X1))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
~ visFreeVar(esk32_0,vapp(veabs,X1)),
inference(spm,[status(thm)],[c_0_51,c_0_56]) ).
cnf(c_0_60,plain,
visFreeVar(X1,vapp(X2,vsubst(X3,vvar(X1),vapp(X4,vvar(X3))))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_59,c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM140+1 : TPTP v8.2.0. Released v6.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 10:21:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 10.75/1.83 # Version: 3.1.0
% 10.75/1.83 # Preprocessing class: FSLSSMSSSSSNFFN.
% 10.75/1.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.75/1.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 10.75/1.83 # Starting new_bool_3 with 300s (1) cores
% 10.75/1.83 # Starting new_bool_1 with 300s (1) cores
% 10.75/1.83 # Starting sh5l with 300s (1) cores
% 10.75/1.83 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 24545 completed with status 0
% 10.75/1.83 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 10.75/1.83 # Preprocessing class: FSLSSMSSSSSNFFN.
% 10.75/1.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.75/1.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 10.75/1.83 # No SInE strategy applied
% 10.75/1.83 # Search class: FGHSF-FSLS32-MFFFFFNN
% 10.75/1.83 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 10.75/1.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 811s (1) cores
% 10.75/1.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 10.75/1.83 # Starting new_bool_3 with 136s (1) cores
% 10.75/1.83 # Starting new_bool_1 with 136s (1) cores
% 10.75/1.83 # Starting sh5l with 136s (1) cores
% 10.75/1.83 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 24562 completed with status 0
% 10.75/1.83 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 10.75/1.83 # Preprocessing class: FSLSSMSSSSSNFFN.
% 10.75/1.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.75/1.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 10.75/1.83 # No SInE strategy applied
% 10.75/1.83 # Search class: FGHSF-FSLS32-MFFFFFNN
% 10.75/1.83 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 10.75/1.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 811s (1) cores
% 10.75/1.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 10.75/1.83 # Preprocessing time : 0.008 s
% 10.75/1.83 # Presaturation interreduction done
% 10.75/1.83
% 10.75/1.83 # Proof found!
% 10.75/1.83 # SZS status Theorem
% 10.75/1.83 # SZS output start CNFRefutation
% See solution above
% 10.75/1.83 # Parsed axioms : 62
% 10.75/1.83 # Removed by relevancy pruning/SinE : 0
% 10.75/1.83 # Initial clauses : 429
% 10.75/1.83 # Removed in clause preprocessing : 13
% 10.75/1.83 # Initial clauses in saturation : 416
% 10.75/1.83 # Processed clauses : 4644
% 10.75/1.83 # ...of these trivial : 135
% 10.75/1.83 # ...subsumed : 2630
% 10.75/1.83 # ...remaining for further processing : 1879
% 10.75/1.83 # Other redundant clauses eliminated : 695
% 10.75/1.83 # Clauses deleted for lack of memory : 0
% 10.75/1.83 # Backward-subsumed : 75
% 10.75/1.83 # Backward-rewritten : 64
% 10.75/1.83 # Generated clauses : 56030
% 10.75/1.83 # ...of the previous two non-redundant : 52603
% 10.75/1.83 # ...aggressively subsumed : 0
% 10.75/1.83 # Contextual simplify-reflections : 17
% 10.75/1.83 # Paramodulations : 55324
% 10.75/1.83 # Factorizations : 4
% 10.75/1.83 # NegExts : 0
% 10.75/1.83 # Equation resolutions : 754
% 10.75/1.83 # Disequality decompositions : 0
% 10.75/1.83 # Total rewrite steps : 5341
% 10.75/1.83 # ...of those cached : 4438
% 10.75/1.83 # Propositional unsat checks : 0
% 10.75/1.83 # Propositional check models : 0
% 10.75/1.83 # Propositional check unsatisfiable : 0
% 10.75/1.83 # Propositional clauses : 0
% 10.75/1.83 # Propositional clauses after purity: 0
% 10.75/1.83 # Propositional unsat core size : 0
% 10.75/1.83 # Propositional preprocessing time : 0.000
% 10.75/1.83 # Propositional encoding time : 0.000
% 10.75/1.83 # Propositional solver time : 0.000
% 10.75/1.83 # Success case prop preproc time : 0.000
% 10.75/1.83 # Success case prop encoding time : 0.000
% 10.75/1.83 # Success case prop solver time : 0.000
% 10.75/1.83 # Current number of processed clauses : 1270
% 10.75/1.83 # Positive orientable unit clauses : 107
% 10.75/1.83 # Positive unorientable unit clauses: 4
% 10.75/1.83 # Negative unit clauses : 50
% 10.75/1.83 # Non-unit-clauses : 1109
% 10.75/1.83 # Current number of unprocessed clauses: 48646
% 10.75/1.83 # ...number of literals in the above : 257367
% 10.75/1.83 # Current number of archived formulas : 0
% 10.75/1.83 # Current number of archived clauses : 515
% 10.75/1.83 # Clause-clause subsumption calls (NU) : 199065
% 10.75/1.83 # Rec. Clause-clause subsumption calls : 74291
% 10.75/1.83 # Non-unit clause-clause subsumptions : 1890
% 10.75/1.83 # Unit Clause-clause subsumption calls : 5966
% 10.75/1.83 # Rewrite failures with RHS unbound : 86
% 10.75/1.83 # BW rewrite match attempts : 570
% 10.75/1.83 # BW rewrite match successes : 13
% 10.75/1.83 # Condensation attempts : 0
% 10.75/1.83 # Condensation successes : 0
% 10.75/1.83 # Termbank termtop insertions : 3373679
% 10.75/1.83 # Search garbage collected termcells : 4059
% 10.75/1.83
% 10.75/1.83 # -------------------------------------------------
% 10.75/1.83 # User time : 1.291 s
% 10.75/1.83 # System time : 0.033 s
% 10.75/1.83 # Total time : 1.325 s
% 10.75/1.83 # Maximum resident set size: 2848 pages
% 10.75/1.83
% 10.75/1.83 # -------------------------------------------------
% 10.75/1.83 # User time : 6.419 s
% 10.75/1.83 # System time : 0.089 s
% 10.75/1.83 # Total time : 6.509 s
% 10.75/1.83 # Maximum resident set size: 1836 pages
% 10.75/1.83 % E---3.1 exiting
%------------------------------------------------------------------------------