TSTP Solution File: SEU394+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU394+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : Sat May 4 09:31:39 EDT 2024
% Result : Theorem 8.47s 1.71s
% Output : CNFRefutation 8.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 25 unt; 0 def)
% Number of atoms : 161 ( 26 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 182 ( 75 ~; 51 |; 39 &)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 55 ( 1 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_yellow19,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.BlXAgU74TB/E---3.1_26959.p',t15_yellow19) ).
fof(t2_yellow19,lemma,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(X1))
& upper_relstr_subset(X2,boole_POSet(X1))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& element(X2,powerset(the_carrier(boole_POSet(X1)))) )
=> ! [X3] :
~ ( in(X3,X2)
& empty(X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BlXAgU74TB/E---3.1_26959.p',t2_yellow19) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox/tmp/tmp.BlXAgU74TB/E---3.1_26959.p',d3_pre_topc) ).
fof(fc2_pre_topc,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.BlXAgU74TB/E---3.1_26959.p',fc2_pre_topc) ).
fof(t4_waybel_7,lemma,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox/tmp/tmp.BlXAgU74TB/E---3.1_26959.p',t4_waybel_7) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/tmp/tmp.BlXAgU74TB/E---3.1_26959.p',t7_boole) ).
fof(t65_zfmisc_1,lemma,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.BlXAgU74TB/E---3.1_26959.p',t65_zfmisc_1) ).
fof(t14_yellow19,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.BlXAgU74TB/E---3.1_26959.p',t14_yellow19) ).
fof(t1_zfmisc_1,lemma,
powerset(empty_set) = singleton(empty_set),
file('/export/starexec/sandbox/tmp/tmp.BlXAgU74TB/E---3.1_26959.p',t1_zfmisc_1) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox/tmp/tmp.BlXAgU74TB/E---3.1_26959.p',fc1_xboole_0) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t15_yellow19])]) ).
fof(c_0_11,lemma,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(X1))
& upper_relstr_subset(X2,boole_POSet(X1))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& element(X2,powerset(the_carrier(boole_POSet(X1)))) )
=> ! [X3] :
~ ( in(X3,X2)
& empty(X3) ) ) ),
inference(fof_simplification,[status(thm)],[t2_yellow19]) ).
fof(c_0_12,plain,
! [X43] :
( ~ one_sorted_str(X43)
| cast_as_carrier_subset(X43) = the_carrier(X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])])]) ).
fof(c_0_13,negated_conjecture,
( ~ empty_carrier(esk1_0)
& one_sorted_str(esk1_0)
& ~ empty(esk2_0)
& filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0)))
& upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0)))
& proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))
& element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))
& esk2_0 != filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_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_14,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
inference(fof_simplification,[status(thm)],[fc2_pre_topc]) ).
fof(c_0_15,lemma,
! [X108,X109,X110] :
( empty(X108)
| empty(X109)
| ~ filtered_subset(X109,boole_POSet(X108))
| ~ upper_relstr_subset(X109,boole_POSet(X108))
| ~ proper_element(X109,powerset(the_carrier(boole_POSet(X108))))
| ~ element(X109,powerset(the_carrier(boole_POSet(X108))))
| ~ in(X110,X109)
| ~ empty(X110) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_16,lemma,
! [X101] : the_carrier(boole_POSet(X101)) = powerset(X101),
inference(variable_rename,[status(thm)],[t4_waybel_7]) ).
fof(c_0_17,plain,
! [X136,X137] :
( ~ in(X136,X137)
| ~ empty(X137) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
cnf(c_0_18,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X45] :
( empty_carrier(X45)
| ~ one_sorted_str(X45)
| ~ empty(cast_as_carrier_subset(X45)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_21,lemma,
( empty(X1)
| empty(X2)
| ~ filtered_subset(X2,boole_POSet(X1))
| ~ upper_relstr_subset(X2,boole_POSet(X1))
| ~ proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
| ~ element(X2,powerset(the_carrier(boole_POSet(X1))))
| ~ in(X3,X2)
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,lemma,
the_carrier(boole_POSet(X1)) = powerset(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
cast_as_carrier_subset(esk1_0) = the_carrier(esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_29,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(cast_as_carrier_subset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_31,lemma,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[t65_zfmisc_1]) ).
fof(c_0_32,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[t14_yellow19]) ).
cnf(c_0_33,lemma,
( empty(X1)
| ~ proper_element(X2,powerset(powerset(X1)))
| ~ upper_relstr_subset(X2,boole_POSet(X1))
| ~ filtered_subset(X2,boole_POSet(X1))
| ~ empty(X3)
| ~ element(X2,powerset(powerset(X1)))
| ~ in(X3,X2) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_23]) ).
cnf(c_0_34,negated_conjecture,
element(esk2_0,powerset(powerset(the_carrier(esk1_0)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22]) ).
cnf(c_0_35,negated_conjecture,
proper_element(esk2_0,powerset(powerset(the_carrier(esk1_0)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_22]) ).
cnf(c_0_36,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(the_carrier(esk1_0))),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_37,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(the_carrier(esk1_0))),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_38,negated_conjecture,
~ empty(the_carrier(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_19])]),c_0_30]) ).
fof(c_0_39,lemma,
! [X231,X232] :
( ( set_difference(X231,singleton(X232)) != X231
| ~ in(X232,X231) )
& ( in(X232,X231)
| set_difference(X231,singleton(X232)) = X231 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])]) ).
fof(c_0_40,lemma,
! [X32,X33] :
( empty_carrier(X32)
| ~ one_sorted_str(X32)
| empty(X33)
| ~ filtered_subset(X33,boole_POSet(cast_as_carrier_subset(X32)))
| ~ upper_relstr_subset(X33,boole_POSet(cast_as_carrier_subset(X32)))
| ~ element(X33,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X32)))))
| set_difference(X33,singleton(empty_set)) = filter_of_net_str(X32,net_of_bool_filter(X32,cast_as_carrier_subset(X32),X33)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])]) ).
cnf(c_0_41,negated_conjecture,
( ~ empty(X1)
| ~ in(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_42,lemma,
( in(X1,X2)
| set_difference(X2,singleton(X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,lemma,
( empty_carrier(X1)
| empty(X2)
| set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2))
| ~ one_sorted_str(X1)
| ~ filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,lemma,
powerset(empty_set) = singleton(empty_set),
inference(split_conjunct,[status(thm)],[t1_zfmisc_1]) ).
cnf(c_0_45,lemma,
( set_difference(esk2_0,singleton(X1)) = esk2_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_47,negated_conjecture,
esk2_0 != filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_48,lemma,
( filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) = set_difference(X2,powerset(empty_set))
| empty(X2)
| empty_carrier(X1)
| ~ upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ element(X2,powerset(powerset(cast_as_carrier_subset(X1))))
| ~ one_sorted_str(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_22]) ).
cnf(c_0_49,negated_conjecture,
element(esk2_0,powerset(powerset(cast_as_carrier_subset(esk1_0)))),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_50,lemma,
set_difference(esk2_0,powerset(empty_set)) = esk2_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_44]) ).
cnf(c_0_51,negated_conjecture,
filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0)) != esk2_0,
inference(spm,[status(thm)],[c_0_47,c_0_25]) ).
cnf(c_0_52,negated_conjecture,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_25]),c_0_50]),c_0_25]),c_0_36]),c_0_25]),c_0_37]),c_0_19])]),c_0_51]),c_0_52]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU394+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 07:39:18 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.42/0.58 Running first-order model finding
% 0.42/0.58 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.BlXAgU74TB/E---3.1_26959.p
% 8.47/1.71 # Version: 3.1.0
% 8.47/1.71 # Preprocessing class: FSLMSMSSSSSNFFN.
% 8.47/1.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.47/1.71 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 8.47/1.71 # Starting new_bool_3 with 600s (2) cores
% 8.47/1.71 # Starting new_bool_1 with 600s (2) cores
% 8.47/1.71 # Starting sh5l with 300s (1) cores
% 8.47/1.71 # new_bool_3 with pid 27119 completed with status 0
% 8.47/1.71 # Result found by new_bool_3
% 8.47/1.71 # Preprocessing class: FSLMSMSSSSSNFFN.
% 8.47/1.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.47/1.71 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 8.47/1.71 # Starting new_bool_3 with 600s (2) cores
% 8.47/1.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.47/1.71 # Search class: FGHSM-SMLM32-MFFFFFNN
% 8.47/1.71 # Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 8.47/1.71 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 45s (1) cores
% 8.47/1.71 # Starting new_bool_3 with 61s (1) cores
% 8.47/1.71 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 27138 completed with status 0
% 8.47/1.71 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.47/1.71 # Preprocessing class: FSLMSMSSSSSNFFN.
% 8.47/1.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.47/1.71 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 8.47/1.71 # Starting new_bool_3 with 600s (2) cores
% 8.47/1.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.47/1.71 # Search class: FGHSM-SMLM32-MFFFFFNN
% 8.47/1.71 # Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 8.47/1.71 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 45s (1) cores
% 8.47/1.71 # Preprocessing time : 0.029 s
% 8.47/1.71 # Presaturation interreduction done
% 8.47/1.71
% 8.47/1.71 # Proof found!
% 8.47/1.71 # SZS status Theorem
% 8.47/1.71 # SZS output start CNFRefutation
% See solution above
% 8.47/1.71 # Parsed axioms : 916
% 8.47/1.71 # Removed by relevancy pruning/SinE : 573
% 8.47/1.71 # Initial clauses : 1958
% 8.47/1.71 # Removed in clause preprocessing : 70
% 8.47/1.71 # Initial clauses in saturation : 1888
% 8.47/1.71 # Processed clauses : 8509
% 8.47/1.71 # ...of these trivial : 170
% 8.47/1.71 # ...subsumed : 2328
% 8.47/1.71 # ...remaining for further processing : 6011
% 8.47/1.71 # Other redundant clauses eliminated : 538
% 8.47/1.71 # Clauses deleted for lack of memory : 0
% 8.47/1.71 # Backward-subsumed : 154
% 8.47/1.71 # Backward-rewritten : 83
% 8.47/1.71 # Generated clauses : 20072
% 8.47/1.71 # ...of the previous two non-redundant : 18553
% 8.47/1.71 # ...aggressively subsumed : 0
% 8.47/1.71 # Contextual simplify-reflections : 241
% 8.47/1.71 # Paramodulations : 19669
% 8.47/1.71 # Factorizations : 2
% 8.47/1.71 # NegExts : 0
% 8.47/1.71 # Equation resolutions : 542
% 8.47/1.71 # Disequality decompositions : 0
% 8.47/1.71 # Total rewrite steps : 4174
% 8.47/1.71 # ...of those cached : 3275
% 8.47/1.71 # Propositional unsat checks : 1
% 8.47/1.71 # Propositional check models : 1
% 8.47/1.71 # Propositional check unsatisfiable : 0
% 8.47/1.71 # Propositional clauses : 0
% 8.47/1.71 # Propositional clauses after purity: 0
% 8.47/1.71 # Propositional unsat core size : 0
% 8.47/1.71 # Propositional preprocessing time : 0.000
% 8.47/1.71 # Propositional encoding time : 0.008
% 8.47/1.71 # Propositional solver time : 0.015
% 8.47/1.71 # Success case prop preproc time : 0.000
% 8.47/1.71 # Success case prop encoding time : 0.000
% 8.47/1.71 # Success case prop solver time : 0.000
% 8.47/1.71 # Current number of processed clauses : 3701
% 8.47/1.71 # Positive orientable unit clauses : 845
% 8.47/1.71 # Positive unorientable unit clauses: 2
% 8.47/1.71 # Negative unit clauses : 558
% 8.47/1.71 # Non-unit-clauses : 2296
% 8.47/1.71 # Current number of unprocessed clauses: 13352
% 8.47/1.71 # ...number of literals in the above : 37088
% 8.47/1.71 # Current number of archived formulas : 0
% 8.47/1.71 # Current number of archived clauses : 1920
% 8.47/1.71 # Clause-clause subsumption calls (NU) : 2140719
% 8.47/1.71 # Rec. Clause-clause subsumption calls : 614508
% 8.47/1.71 # Non-unit clause-clause subsumptions : 1339
% 8.47/1.71 # Unit Clause-clause subsumption calls : 67268
% 8.47/1.71 # Rewrite failures with RHS unbound : 0
% 8.47/1.71 # BW rewrite match attempts : 167
% 8.47/1.71 # BW rewrite match successes : 92
% 8.47/1.71 # Condensation attempts : 0
% 8.47/1.71 # Condensation successes : 0
% 8.47/1.71 # Termbank termtop insertions : 442482
% 8.47/1.71 # Search garbage collected termcells : 26014
% 8.47/1.71
% 8.47/1.71 # -------------------------------------------------
% 8.47/1.71 # User time : 1.049 s
% 8.47/1.71 # System time : 0.031 s
% 8.47/1.71 # Total time : 1.080 s
% 8.47/1.71 # Maximum resident set size: 6888 pages
% 8.47/1.71
% 8.47/1.71 # -------------------------------------------------
% 8.47/1.71 # User time : 2.084 s
% 8.47/1.71 # System time : 0.035 s
% 8.47/1.71 # Total time : 2.119 s
% 8.47/1.71 # Maximum resident set size: 3016 pages
% 8.47/1.71 % E---3.1 exiting
%------------------------------------------------------------------------------