TSTP Solution File: SEU315+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU315+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:25:57 EDT 2023
% Result : Theorem 1.61s 0.65s
% Output : CNFRefutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 52 ( 12 unt; 0 def)
% Number of atoms : 248 ( 11 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 329 ( 133 ~; 140 |; 38 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 95 ( 2 sgn; 34 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9aVZ2z4Bgj/E---3.1_11439.p',d2_subset_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/tmp/tmp.9aVZ2z4Bgj/E---3.1_11439.p',t7_boole) ).
fof(s1_xboole_0__e1_40__pre_topc__1,axiom,
! [X1,X2] :
( ( topological_space(X1)
& top_str(X1)
& element(X2,powerset(the_carrier(X1))) )
=> ? [X3] :
! [X4] :
( in(X4,X3)
<=> ( in(X4,powerset(the_carrier(X1)))
& ? [X5] :
( element(X5,powerset(the_carrier(X1)))
& X5 = X4
& closed_subset(X5,X1)
& subset(X2,X4) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9aVZ2z4Bgj/E---3.1_11439.p',s1_xboole_0__e1_40__pre_topc__1) ).
fof(s3_subset_1__e1_40__pre_topc,conjecture,
! [X1,X2] :
( ( topological_space(X1)
& top_str(X1)
& element(X2,powerset(the_carrier(X1))) )
=> ? [X3] :
( element(X3,powerset(powerset(the_carrier(X1))))
& ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( in(X4,X3)
<=> ? [X5] :
( element(X5,powerset(the_carrier(X1)))
& X5 = X4
& closed_subset(X5,X1)
& subset(X2,X4) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9aVZ2z4Bgj/E---3.1_11439.p',s3_subset_1__e1_40__pre_topc) ).
fof(l71_subset_1,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.9aVZ2z4Bgj/E---3.1_11439.p',l71_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox/tmp/tmp.9aVZ2z4Bgj/E---3.1_11439.p',fc1_subset_1) ).
fof(c_0_6,plain,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_7,plain,
! [X56,X57] :
( ( ~ element(X57,X56)
| in(X57,X56)
| empty(X56) )
& ( ~ in(X57,X56)
| element(X57,X56)
| empty(X56) )
& ( ~ element(X57,X56)
| empty(X57)
| ~ empty(X56) )
& ( ~ empty(X57)
| element(X57,X56)
| ~ empty(X56) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X66,X67] :
( ~ in(X66,X67)
| ~ empty(X67) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_9,plain,
! [X49,X50,X52,X54,X55] :
( ( in(X52,powerset(the_carrier(X49)))
| ~ in(X52,esk9_2(X49,X50))
| ~ topological_space(X49)
| ~ top_str(X49)
| ~ element(X50,powerset(the_carrier(X49))) )
& ( element(esk10_3(X49,X50,X52),powerset(the_carrier(X49)))
| ~ in(X52,esk9_2(X49,X50))
| ~ topological_space(X49)
| ~ top_str(X49)
| ~ element(X50,powerset(the_carrier(X49))) )
& ( esk10_3(X49,X50,X52) = X52
| ~ in(X52,esk9_2(X49,X50))
| ~ topological_space(X49)
| ~ top_str(X49)
| ~ element(X50,powerset(the_carrier(X49))) )
& ( closed_subset(esk10_3(X49,X50,X52),X49)
| ~ in(X52,esk9_2(X49,X50))
| ~ topological_space(X49)
| ~ top_str(X49)
| ~ element(X50,powerset(the_carrier(X49))) )
& ( subset(X50,X52)
| ~ in(X52,esk9_2(X49,X50))
| ~ topological_space(X49)
| ~ top_str(X49)
| ~ element(X50,powerset(the_carrier(X49))) )
& ( ~ in(X54,powerset(the_carrier(X49)))
| ~ element(X55,powerset(the_carrier(X49)))
| X55 != X54
| ~ closed_subset(X55,X49)
| ~ subset(X50,X54)
| in(X54,esk9_2(X49,X50))
| ~ topological_space(X49)
| ~ top_str(X49)
| ~ element(X50,powerset(the_carrier(X49))) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[s1_xboole_0__e1_40__pre_topc__1])])])])])]) ).
cnf(c_0_10,plain,
( element(X1,X2)
| empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2] :
( ( topological_space(X1)
& top_str(X1)
& element(X2,powerset(the_carrier(X1))) )
=> ? [X3] :
( element(X3,powerset(powerset(the_carrier(X1))))
& ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( in(X4,X3)
<=> ? [X5] :
( element(X5,powerset(the_carrier(X1)))
& X5 = X4
& closed_subset(X5,X1)
& subset(X2,X4) ) ) ) ) ),
inference(assume_negation,[status(cth)],[s3_subset_1__e1_40__pre_topc]) ).
cnf(c_0_13,plain,
( in(X1,esk9_2(X2,X4))
| ~ in(X1,powerset(the_carrier(X2)))
| ~ element(X3,powerset(the_carrier(X2)))
| X3 != X1
| ~ closed_subset(X3,X2)
| ~ subset(X4,X1)
| ~ topological_space(X2)
| ~ top_str(X2)
| ~ element(X4,powerset(the_carrier(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,negated_conjecture,
! [X8,X10] :
( topological_space(esk1_0)
& top_str(esk1_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& ( element(esk3_1(X8),powerset(the_carrier(esk1_0)))
| ~ element(X8,powerset(powerset(the_carrier(esk1_0)))) )
& ( ~ in(esk3_1(X8),X8)
| ~ element(X10,powerset(the_carrier(esk1_0)))
| X10 != esk3_1(X8)
| ~ closed_subset(X10,esk1_0)
| ~ subset(esk2_0,esk3_1(X8))
| ~ element(X8,powerset(powerset(the_carrier(esk1_0)))) )
& ( element(esk4_1(X8),powerset(the_carrier(esk1_0)))
| in(esk3_1(X8),X8)
| ~ element(X8,powerset(powerset(the_carrier(esk1_0)))) )
& ( esk4_1(X8) = esk3_1(X8)
| in(esk3_1(X8),X8)
| ~ element(X8,powerset(powerset(the_carrier(esk1_0)))) )
& ( closed_subset(esk4_1(X8),esk1_0)
| in(esk3_1(X8),X8)
| ~ element(X8,powerset(powerset(the_carrier(esk1_0)))) )
& ( subset(esk2_0,esk3_1(X8))
| in(esk3_1(X8),X8)
| ~ element(X8,powerset(powerset(the_carrier(esk1_0)))) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
fof(c_0_16,plain,
! [X60,X61] :
( ( in(esk12_2(X60,X61),X60)
| element(X60,powerset(X61)) )
& ( ~ in(esk12_2(X60,X61),X61)
| element(X60,powerset(X61)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l71_subset_1])])])]) ).
cnf(c_0_17,plain,
( in(X1,esk9_2(X2,X3))
| ~ subset(X3,X1)
| ~ closed_subset(X1,X2)
| ~ in(X1,powerset(the_carrier(X2)))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ top_str(X2)
| ~ topological_space(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( subset(esk2_0,esk3_1(X1))
| in(esk3_1(X1),X1)
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( closed_subset(esk4_1(X1),esk1_0)
| in(esk3_1(X1),X1)
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( esk4_1(X1) = esk3_1(X1)
| in(esk3_1(X1),X1)
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( in(X1,powerset(the_carrier(X2)))
| ~ in(X1,esk9_2(X2,X3))
| ~ topological_space(X2)
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( in(esk12_2(X1,X2),X1)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( in(esk3_1(X1),esk9_2(X2,esk2_0))
| in(esk3_1(X1),X1)
| ~ closed_subset(esk3_1(X1),X2)
| ~ in(esk3_1(X1),powerset(the_carrier(X2)))
| ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
| ~ element(esk2_0,powerset(the_carrier(X2)))
| ~ top_str(X2)
| ~ topological_space(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( closed_subset(esk3_1(X1),esk1_0)
| in(esk3_1(X1),X1)
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,plain,
( element(X1,powerset(X2))
| ~ in(esk12_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
( in(esk12_2(esk9_2(X1,X2),X3),powerset(the_carrier(X1)))
| element(esk9_2(X1,X2),powerset(X3))
| ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1)
| ~ topological_space(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_30,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
cnf(c_0_31,negated_conjecture,
( in(esk3_1(X1),esk9_2(esk1_0,esk2_0))
| in(esk3_1(X1),X1)
| ~ in(esk3_1(X1),powerset(the_carrier(esk1_0)))
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_32,plain,
( element(esk9_2(X1,X2),powerset(powerset(the_carrier(X1))))
| ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1)
| ~ topological_space(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_33,plain,
! [X48] : ~ empty(powerset(X48)),
inference(variable_rename,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,esk2_0))
| in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,X1))
| ~ in(esk3_1(esk9_2(esk1_0,X1)),powerset(the_carrier(esk1_0)))
| ~ element(X1,powerset(the_carrier(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_27])]) ).
cnf(c_0_35,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_36,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,esk2_0))
| in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,X1))
| ~ element(esk3_1(esk9_2(esk1_0,X1)),powerset(the_carrier(esk1_0)))
| ~ element(X1,powerset(the_carrier(esk1_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_38,negated_conjecture,
( element(esk3_1(X1),powerset(the_carrier(esk1_0)))
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_39,negated_conjecture,
( in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,esk2_0))
| in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,X1))
| ~ element(esk9_2(esk1_0,X1),powerset(powerset(the_carrier(esk1_0))))
| ~ element(X1,powerset(the_carrier(esk1_0))) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
( in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,esk2_0))
| in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,X1))
| ~ element(X1,powerset(the_carrier(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_26]),c_0_27])]) ).
cnf(c_0_41,plain,
( closed_subset(esk10_3(X1,X2,X3),X1)
| ~ in(X3,esk9_2(X1,X2))
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_42,plain,
( esk10_3(X1,X2,X3) = X3
| ~ in(X3,esk9_2(X1,X2))
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_43,negated_conjecture,
( ~ in(esk3_1(X1),X1)
| ~ element(X2,powerset(the_carrier(esk1_0)))
| X2 != esk3_1(X1)
| ~ closed_subset(X2,esk1_0)
| ~ subset(esk2_0,esk3_1(X1))
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_44,plain,
( subset(X1,X2)
| ~ in(X2,esk9_2(X3,X1))
| ~ topological_space(X3)
| ~ top_str(X3)
| ~ element(X1,powerset(the_carrier(X3))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_45,negated_conjecture,
in(esk3_1(esk9_2(esk1_0,esk2_0)),esk9_2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_40,c_0_25]) ).
cnf(c_0_46,plain,
( closed_subset(X1,X2)
| ~ in(X1,esk9_2(X2,X3))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ top_str(X2)
| ~ topological_space(X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( ~ subset(esk2_0,esk3_1(X1))
| ~ closed_subset(esk3_1(X1),esk1_0)
| ~ in(esk3_1(X1),X1)
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_38]) ).
cnf(c_0_48,negated_conjecture,
subset(esk2_0,esk3_1(esk9_2(esk1_0,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_49,negated_conjecture,
closed_subset(esk3_1(esk9_2(esk1_0,esk2_0)),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_45]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_50,negated_conjecture,
~ element(esk9_2(esk1_0,esk2_0),powerset(powerset(the_carrier(esk1_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_45])]),c_0_49])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_32]),c_0_25]),c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU315+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n009.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 08:20:14 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.9aVZ2z4Bgj/E---3.1_11439.p
% 1.61/0.65 # Version: 3.1pre001
% 1.61/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.61/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.61/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.61/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.61/0.65 # Starting sh5l with 300s (1) cores
% 1.61/0.65 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11517 completed with status 0
% 1.61/0.65 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.61/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.61/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.61/0.65 # No SInE strategy applied
% 1.61/0.65 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1.61/0.65 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.61/0.65 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 113s (1) cores
% 1.61/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.61/0.65 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 1.61/0.65 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 1.61/0.65 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 1.61/0.65 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 11523 completed with status 0
% 1.61/0.65 # Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 1.61/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.61/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.61/0.65 # No SInE strategy applied
% 1.61/0.65 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1.61/0.65 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.61/0.65 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 113s (1) cores
% 1.61/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.61/0.65 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 1.61/0.65 # Preprocessing time : 0.001 s
% 1.61/0.65
% 1.61/0.65 # Proof found!
% 1.61/0.65 # SZS status Theorem
% 1.61/0.65 # SZS output start CNFRefutation
% See solution above
% 1.61/0.65 # Parsed axioms : 39
% 1.61/0.65 # Removed by relevancy pruning/SinE : 0
% 1.61/0.65 # Initial clauses : 88
% 1.61/0.65 # Removed in clause preprocessing : 5
% 1.61/0.65 # Initial clauses in saturation : 83
% 1.61/0.65 # Processed clauses : 3119
% 1.61/0.65 # ...of these trivial : 42
% 1.61/0.65 # ...subsumed : 2012
% 1.61/0.65 # ...remaining for further processing : 1065
% 1.61/0.65 # Other redundant clauses eliminated : 2
% 1.61/0.65 # Clauses deleted for lack of memory : 0
% 1.61/0.65 # Backward-subsumed : 22
% 1.61/0.65 # Backward-rewritten : 12
% 1.61/0.65 # Generated clauses : 3710
% 1.61/0.65 # ...of the previous two non-redundant : 3445
% 1.61/0.65 # ...aggressively subsumed : 0
% 1.61/0.65 # Contextual simplify-reflections : 64
% 1.61/0.65 # Paramodulations : 3696
% 1.61/0.65 # Factorizations : 0
% 1.61/0.65 # NegExts : 0
% 1.61/0.65 # Equation resolutions : 2
% 1.61/0.65 # Total rewrite steps : 2867
% 1.61/0.65 # Propositional unsat checks : 0
% 1.61/0.65 # Propositional check models : 0
% 1.61/0.65 # Propositional check unsatisfiable : 0
% 1.61/0.65 # Propositional clauses : 0
% 1.61/0.65 # Propositional clauses after purity: 0
% 1.61/0.65 # Propositional unsat core size : 0
% 1.61/0.65 # Propositional preprocessing time : 0.000
% 1.61/0.65 # Propositional encoding time : 0.000
% 1.61/0.65 # Propositional solver time : 0.000
% 1.61/0.65 # Success case prop preproc time : 0.000
% 1.61/0.65 # Success case prop encoding time : 0.000
% 1.61/0.65 # Success case prop solver time : 0.000
% 1.61/0.65 # Current number of processed clauses : 1024
% 1.61/0.65 # Positive orientable unit clauses : 36
% 1.61/0.65 # Positive unorientable unit clauses: 0
% 1.61/0.65 # Negative unit clauses : 22
% 1.61/0.65 # Non-unit-clauses : 966
% 1.61/0.65 # Current number of unprocessed clauses: 314
% 1.61/0.65 # ...number of literals in the above : 2291
% 1.61/0.65 # Current number of archived formulas : 0
% 1.61/0.65 # Current number of archived clauses : 34
% 1.61/0.65 # Clause-clause subsumption calls (NU) : 441319
% 1.61/0.65 # Rec. Clause-clause subsumption calls : 86437
% 1.61/0.65 # Non-unit clause-clause subsumptions : 2015
% 1.61/0.65 # Unit Clause-clause subsumption calls : 1238
% 1.61/0.65 # Rewrite failures with RHS unbound : 0
% 1.61/0.65 # BW rewrite match attempts : 22
% 1.61/0.65 # BW rewrite match successes : 9
% 1.61/0.65 # Condensation attempts : 0
% 1.61/0.65 # Condensation successes : 0
% 1.61/0.65 # Termbank termtop insertions : 98509
% 1.61/0.65
% 1.61/0.65 # -------------------------------------------------
% 1.61/0.65 # User time : 0.215 s
% 1.61/0.65 # System time : 0.002 s
% 1.61/0.65 # Total time : 0.217 s
% 1.61/0.65 # Maximum resident set size: 1888 pages
% 1.61/0.65
% 1.61/0.65 # -------------------------------------------------
% 1.61/0.65 # User time : 1.007 s
% 1.61/0.65 # System time : 0.023 s
% 1.61/0.65 # Total time : 1.030 s
% 1.61/0.65 # Maximum resident set size: 1732 pages
% 1.61/0.65 % E---3.1 exiting
% 1.61/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------