TSTP Solution File: KLE100+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE100+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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 18:04:09 EDT 2023
% Result : Theorem 1.28s 0.56s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of formulae : 85 ( 82 unt; 0 def)
% Number of atoms : 88 ( 87 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 1 =>; 1 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 115 ( 4 sgn; 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',multiplicative_right_identity) ).
fof(domain1,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',domain1) ).
fof(domain3,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',domain3) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',domain4) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',additive_commutativity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',additive_identity) ).
fof(complement,axiom,
! [X4] : c(X4) = antidomain(domain(X4)),
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',complement) ).
fof(domain2,axiom,
! [X4,X5] : addition(antidomain(multiplication(X4,X5)),antidomain(multiplication(X4,antidomain(antidomain(X5))))) = antidomain(multiplication(X4,antidomain(antidomain(X5)))),
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',domain2) ).
fof(goals,conjecture,
! [X4,X5,X6] :
( addition(forward_diamond(X4,domain(X5)),domain(X6)) = domain(X6)
<= multiplication(antidomain(X6),multiplication(X4,domain(X5))) = zero ),
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',goals) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',additive_idempotence) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',right_distributivity) ).
fof(domain_difference,axiom,
! [X4,X5] : domain_difference(X4,X5) = multiplication(domain(X4),antidomain(X5)),
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',domain_difference) ).
fof(forward_diamond,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',forward_diamond) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',multiplicative_left_identity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p',left_distributivity) ).
fof(c_0_16,plain,
! [X18] : multiplication(X18,one) = X18,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_17,plain,
! [X13] : multiplication(antidomain(X13),X13) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_18,plain,
! [X36] : addition(antidomain(antidomain(X36)),antidomain(X36)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_19,plain,
! [X32] : domain(X32) = antidomain(antidomain(X32)),
inference(variable_rename,[status(thm)],[domain4]) ).
fof(c_0_20,plain,
! [X37,X38] : addition(X37,X38) = addition(X38,X37),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_21,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X10] : addition(X10,zero) = X10,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_24,plain,
! [X33] : c(X33) = antidomain(domain(X33)),
inference(variable_rename,[status(thm)],[complement]) ).
fof(c_0_25,plain,
! [X26,X27] : addition(antidomain(multiplication(X26,X27)),antidomain(multiplication(X26,antidomain(antidomain(X27))))) = antidomain(multiplication(X26,antidomain(antidomain(X27)))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_26,negated_conjecture,
~ ! [X4,X5,X6] :
( multiplication(antidomain(X6),multiplication(X4,domain(X5))) = zero
=> addition(forward_diamond(X4,domain(X5)),domain(X6)) = domain(X6) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
cnf(c_0_27,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_32,plain,
! [X39,X40,X41] : addition(X41,addition(X40,X39)) = addition(addition(X41,X40),X39),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_33,plain,
! [X42] : addition(X42,X42) = X42,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_34,plain,
! [X20,X21,X22] : multiplication(X20,addition(X21,X22)) = addition(multiplication(X20,X21),multiplication(X20,X22)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_35,plain,
! [X34,X35] : domain_difference(X34,X35) = multiplication(domain(X34),antidomain(X35)),
inference(variable_rename,[status(thm)],[domain_difference]) ).
cnf(c_0_36,plain,
c(X1) = antidomain(domain(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_37,plain,
! [X30,X31] : forward_diamond(X30,X31) = domain(multiplication(X30,domain(X31))),
inference(variable_rename,[status(thm)],[forward_diamond]) ).
fof(c_0_38,plain,
! [X19] : multiplication(one,X19) = X19,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_39,plain,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2))))) = antidomain(multiplication(X1,antidomain(antidomain(X2)))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_40,negated_conjecture,
( multiplication(antidomain(esk3_0),multiplication(esk1_0,domain(esk2_0))) = zero
& addition(forward_diamond(esk1_0,domain(esk2_0)),domain(esk3_0)) != domain(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
cnf(c_0_41,plain,
addition(antidomain(X1),domain(X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_42,plain,
domain(one) = antidomain(zero),
inference(spm,[status(thm)],[c_0_28,c_0_30]) ).
cnf(c_0_43,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_44,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_46,plain,
! [X23,X24,X25] : multiplication(addition(X23,X24),X25) = addition(multiplication(X23,X25),multiplication(X24,X25)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_47,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_48,plain,
domain_difference(X1,X2) = multiplication(domain(X1),antidomain(X2)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_49,plain,
domain(antidomain(X1)) = c(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_28]),c_0_36]) ).
cnf(c_0_50,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_51,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_52,plain,
domain(domain(X1)) = antidomain(c(X1)),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_53,plain,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,domain(X2)))) = antidomain(multiplication(X1,domain(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_28]),c_0_28]) ).
cnf(c_0_54,negated_conjecture,
multiplication(antidomain(esk3_0),multiplication(esk1_0,domain(esk2_0))) = zero,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_55,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_30]),c_0_43]) ).
cnf(c_0_56,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_57,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_58,plain,
multiplication(antidomain(X1),addition(X2,X1)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_22]),c_0_31]) ).
cnf(c_0_59,plain,
multiplication(c(X1),antidomain(X2)) = domain_difference(antidomain(X1),X2),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_60,plain,
antidomain(c(X1)) = forward_diamond(one,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_61,negated_conjecture,
addition(one,antidomain(multiplication(antidomain(esk3_0),forward_diamond(esk1_0,esk2_0)))) = antidomain(multiplication(antidomain(esk3_0),forward_diamond(esk1_0,esk2_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_50]),c_0_50]),c_0_55]) ).
cnf(c_0_62,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_41]),c_0_29]) ).
cnf(c_0_63,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_22]),c_0_43]) ).
cnf(c_0_64,plain,
domain_difference(antidomain(X1),X1) = c(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_41]),c_0_36]),c_0_21]),c_0_36]),c_0_59]) ).
cnf(c_0_65,plain,
c(antidomain(X1)) = forward_diamond(one,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_28]),c_0_52]),c_0_60]) ).
cnf(c_0_66,negated_conjecture,
antidomain(multiplication(antidomain(esk3_0),forward_diamond(esk1_0,esk2_0))) = one,
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,plain,
multiplication(domain(X1),domain(X2)) = domain_difference(X1,antidomain(X2)),
inference(spm,[status(thm)],[c_0_48,c_0_28]) ).
cnf(c_0_68,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_41]),c_0_51]) ).
cnf(c_0_69,plain,
domain_difference(domain(X1),antidomain(X1)) = forward_diamond(one,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_28]),c_0_65]) ).
cnf(c_0_70,negated_conjecture,
multiplication(antidomain(esk3_0),forward_diamond(esk1_0,esk2_0)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_66]),c_0_51]) ).
cnf(c_0_71,plain,
addition(domain(X1),c(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_49]),c_0_28]) ).
cnf(c_0_72,plain,
domain(domain(X1)) = forward_diamond(one,X1),
inference(rw,[status(thm)],[c_0_52,c_0_60]) ).
cnf(c_0_73,plain,
forward_diamond(one,X1) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
cnf(c_0_74,negated_conjecture,
multiplication(addition(antidomain(esk3_0),X1),forward_diamond(esk1_0,esk2_0)) = multiplication(X1,forward_diamond(esk1_0,esk2_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_70]),c_0_43]) ).
cnf(c_0_75,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_71]),c_0_29]) ).
cnf(c_0_76,negated_conjecture,
addition(forward_diamond(esk1_0,domain(esk2_0)),domain(esk3_0)) != domain(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_77,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_21]),c_0_29]) ).
cnf(c_0_79,negated_conjecture,
multiplication(domain(esk3_0),forward_diamond(esk1_0,esk2_0)) = forward_diamond(esk1_0,esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_41]),c_0_51]) ).
cnf(c_0_80,plain,
addition(one,forward_diamond(X1,X2)) = one,
inference(spm,[status(thm)],[c_0_75,c_0_50]) ).
cnf(c_0_81,negated_conjecture,
addition(domain(esk3_0),forward_diamond(esk1_0,domain(esk2_0))) != domain(esk3_0),
inference(rw,[status(thm)],[c_0_76,c_0_29]) ).
cnf(c_0_82,plain,
forward_diamond(X1,domain(X2)) = forward_diamond(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_77]),c_0_50]) ).
cnf(c_0_83,negated_conjecture,
addition(domain(esk3_0),forward_diamond(esk1_0,esk2_0)) = domain(esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_29]),c_0_80]),c_0_21]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_83])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : KLE100+1 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n001.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 05:17:52 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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/tmp/tmp.o1dx5vpRUF/E---3.1_28155.p
% 1.28/0.56 # Version: 3.1pre001
% 1.28/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.28/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.28/0.56 # Starting new_bool_3 with 300s (1) cores
% 1.28/0.56 # Starting new_bool_1 with 300s (1) cores
% 1.28/0.56 # Starting sh5l with 300s (1) cores
% 1.28/0.56 # sh5l with pid 28236 completed with status 0
% 1.28/0.56 # Result found by sh5l
% 1.28/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.28/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.28/0.56 # Starting new_bool_3 with 300s (1) cores
% 1.28/0.56 # Starting new_bool_1 with 300s (1) cores
% 1.28/0.56 # Starting sh5l with 300s (1) cores
% 1.28/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.28/0.56 # Search class: FUUPM-FFMF21-MFFFFFNN
% 1.28/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.28/0.56 # Starting U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.28/0.56 # U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 28241 completed with status 0
% 1.28/0.56 # Result found by U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 1.28/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.28/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.28/0.56 # Starting new_bool_3 with 300s (1) cores
% 1.28/0.56 # Starting new_bool_1 with 300s (1) cores
% 1.28/0.56 # Starting sh5l with 300s (1) cores
% 1.28/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.28/0.56 # Search class: FUUPM-FFMF21-MFFFFFNN
% 1.28/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.28/0.56 # Starting U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.28/0.56 # Preprocessing time : 0.001 s
% 1.28/0.56 # Presaturation interreduction done
% 1.28/0.56
% 1.28/0.56 # Proof found!
% 1.28/0.56 # SZS status Theorem
% 1.28/0.56 # SZS output start CNFRefutation
% See solution above
% 1.28/0.56 # Parsed axioms : 27
% 1.28/0.56 # Removed by relevancy pruning/SinE : 1
% 1.28/0.56 # Initial clauses : 27
% 1.28/0.56 # Removed in clause preprocessing : 0
% 1.28/0.56 # Initial clauses in saturation : 27
% 1.28/0.56 # Processed clauses : 1001
% 1.28/0.56 # ...of these trivial : 387
% 1.28/0.56 # ...subsumed : 29
% 1.28/0.56 # ...remaining for further processing : 585
% 1.28/0.56 # Other redundant clauses eliminated : 0
% 1.28/0.56 # Clauses deleted for lack of memory : 0
% 1.28/0.56 # Backward-subsumed : 0
% 1.28/0.56 # Backward-rewritten : 221
% 1.28/0.56 # Generated clauses : 12788
% 1.28/0.56 # ...of the previous two non-redundant : 7217
% 1.28/0.56 # ...aggressively subsumed : 0
% 1.28/0.56 # Contextual simplify-reflections : 0
% 1.28/0.56 # Paramodulations : 12788
% 1.28/0.56 # Factorizations : 0
% 1.28/0.56 # NegExts : 0
% 1.28/0.56 # Equation resolutions : 0
% 1.28/0.56 # Total rewrite steps : 21247
% 1.28/0.56 # Propositional unsat checks : 0
% 1.28/0.56 # Propositional check models : 0
% 1.28/0.56 # Propositional check unsatisfiable : 0
% 1.28/0.56 # Propositional clauses : 0
% 1.28/0.56 # Propositional clauses after purity: 0
% 1.28/0.56 # Propositional unsat core size : 0
% 1.28/0.56 # Propositional preprocessing time : 0.000
% 1.28/0.56 # Propositional encoding time : 0.000
% 1.28/0.56 # Propositional solver time : 0.000
% 1.28/0.56 # Success case prop preproc time : 0.000
% 1.28/0.56 # Success case prop encoding time : 0.000
% 1.28/0.56 # Success case prop solver time : 0.000
% 1.28/0.56 # Current number of processed clauses : 337
% 1.28/0.56 # Positive orientable unit clauses : 334
% 1.28/0.56 # Positive unorientable unit clauses: 3
% 1.28/0.56 # Negative unit clauses : 0
% 1.28/0.56 # Non-unit-clauses : 0
% 1.28/0.56 # Current number of unprocessed clauses: 6038
% 1.28/0.56 # ...number of literals in the above : 6038
% 1.28/0.56 # Current number of archived formulas : 0
% 1.28/0.56 # Current number of archived clauses : 248
% 1.28/0.56 # Clause-clause subsumption calls (NU) : 0
% 1.28/0.56 # Rec. Clause-clause subsumption calls : 0
% 1.28/0.56 # Non-unit clause-clause subsumptions : 0
% 1.28/0.56 # Unit Clause-clause subsumption calls : 5
% 1.28/0.56 # Rewrite failures with RHS unbound : 0
% 1.28/0.56 # BW rewrite match attempts : 422
% 1.28/0.56 # BW rewrite match successes : 151
% 1.28/0.56 # Condensation attempts : 0
% 1.28/0.56 # Condensation successes : 0
% 1.28/0.56 # Termbank termtop insertions : 150080
% 1.28/0.56
% 1.28/0.56 # -------------------------------------------------
% 1.28/0.56 # User time : 0.125 s
% 1.28/0.56 # System time : 0.009 s
% 1.28/0.56 # Total time : 0.133 s
% 1.28/0.56 # Maximum resident set size: 1744 pages
% 1.28/0.56
% 1.28/0.56 # -------------------------------------------------
% 1.28/0.56 # User time : 0.126 s
% 1.28/0.56 # System time : 0.010 s
% 1.28/0.56 # Total time : 0.136 s
% 1.28/0.56 # Maximum resident set size: 1696 pages
% 1.28/0.56 % E---3.1 exiting
% 1.28/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------