TSTP Solution File: GEO127+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO127+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:31:33 EDT 2023
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 69 ( 24 unt; 0 def)
% Number of atoms : 211 ( 16 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 224 ( 82 ~; 92 |; 36 &)
% ( 10 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 116 ( 10 sgn; 60 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(theorem_4_12,conjecture,
! [X9,X3] :
( incident_o(X3,X9)
<=> ? [X5] :
( ordered_by(X9,X3,X5)
| ordered_by(X9,X5,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',theorem_4_12) ).
fof(o1,axiom,
! [X9,X3,X5] :
( ordered_by(X9,X3,X5)
=> ( incident_o(X3,X9)
& incident_o(X5,X9) ) ),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',o1) ).
fof(start_point_defn,axiom,
! [X3,X9] :
( start_point(X3,X9)
<=> ( incident_o(X3,X9)
& ! [X5] :
( ( X3 != X5
& incident_o(X5,X9) )
=> ordered_by(X9,X3,X5) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',start_point_defn) ).
fof(finish_point_defn,axiom,
! [X3,X9] :
( finish_point(X3,X9)
<=> ( incident_o(X3,X9)
& ! [X5] :
( ( X3 != X5
& incident_o(X5,X9) )
=> ordered_by(X9,X5,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',finish_point_defn) ).
fof(o4,axiom,
! [X9] :
? [X3] : start_point(X3,X9),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',o4) ).
fof(inner_point_defn,axiom,
! [X3,X1] :
( inner_point(X3,X1)
<=> ( incident_c(X3,X1)
& ~ end_point(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',inner_point_defn) ).
fof(open_defn,axiom,
! [X1] :
( open(X1)
<=> ? [X3] : end_point(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',open_defn) ).
fof(o2,axiom,
! [X9] :
? [X1] :
( open(X1)
& ! [X3] :
( incident_o(X3,X9)
<=> incident_c(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',o2) ).
fof(c3,axiom,
! [X1] :
? [X3] : inner_point(X3,X1),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',c3) ).
fof(end_point_defn,axiom,
! [X3,X1] :
( end_point(X3,X1)
<=> ( incident_c(X3,X1)
& ! [X2,X4] :
( ( part_of(X2,X1)
& part_of(X4,X1)
& incident_c(X3,X2)
& incident_c(X3,X4) )
=> ( part_of(X2,X4)
| part_of(X4,X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',end_point_defn) ).
fof(closed_defn,axiom,
! [X1] :
( closed(X1)
<=> ~ ? [X3] : end_point(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.p8gDBGPXJt/E---3.1_20120.p',closed_defn) ).
fof(c_0_11,negated_conjecture,
~ ! [X9,X3] :
( incident_o(X3,X9)
<=> ? [X5] :
( ordered_by(X9,X3,X5)
| ordered_by(X9,X5,X3) ) ),
inference(assume_negation,[status(cth)],[theorem_4_12]) ).
fof(c_0_12,plain,
! [X111,X112,X113] :
( ( incident_o(X112,X111)
| ~ ordered_by(X111,X112,X113) )
& ( incident_o(X113,X111)
| ~ ordered_by(X111,X112,X113) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[o1])])]) ).
fof(c_0_13,negated_conjecture,
! [X152] :
( ( ~ ordered_by(esk25_0,esk26_0,X152)
| ~ incident_o(esk26_0,esk25_0) )
& ( ~ ordered_by(esk25_0,X152,esk26_0)
| ~ incident_o(esk26_0,esk25_0) )
& ( incident_o(esk26_0,esk25_0)
| ordered_by(esk25_0,esk26_0,esk27_0)
| ordered_by(esk25_0,esk27_0,esk26_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_11])])])])]) ).
cnf(c_0_14,plain,
( incident_o(X1,X2)
| ~ ordered_by(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( incident_o(esk26_0,esk25_0)
| ordered_by(esk25_0,esk26_0,esk27_0)
| ordered_by(esk25_0,esk27_0,esk26_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( incident_o(X1,X2)
| ~ ordered_by(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( incident_o(esk26_0,esk25_0)
| ordered_by(esk25_0,esk26_0,esk27_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X99,X100,X101,X102,X103] :
( ( incident_o(X99,X100)
| ~ start_point(X99,X100) )
& ( X99 = X101
| ~ incident_o(X101,X100)
| ordered_by(X100,X99,X101)
| ~ start_point(X99,X100) )
& ( X102 != esk15_2(X102,X103)
| ~ incident_o(X102,X103)
| start_point(X102,X103) )
& ( incident_o(esk15_2(X102,X103),X103)
| ~ incident_o(X102,X103)
| start_point(X102,X103) )
& ( ~ ordered_by(X103,X102,esk15_2(X102,X103))
| ~ incident_o(X102,X103)
| start_point(X102,X103) ) ),
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)],[start_point_defn])])])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ ordered_by(esk25_0,X1,esk26_0)
| ~ incident_o(esk26_0,esk25_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
incident_o(esk26_0,esk25_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_21,plain,
! [X105,X106,X107,X108,X109] :
( ( incident_o(X105,X106)
| ~ finish_point(X105,X106) )
& ( X105 = X107
| ~ incident_o(X107,X106)
| ordered_by(X106,X107,X105)
| ~ finish_point(X105,X106) )
& ( X108 != esk16_2(X108,X109)
| ~ incident_o(X108,X109)
| finish_point(X108,X109) )
& ( incident_o(esk16_2(X108,X109),X109)
| ~ incident_o(X108,X109)
| finish_point(X108,X109) )
& ( ~ ordered_by(X109,esk16_2(X108,X109),X108)
| ~ incident_o(X108,X109)
| finish_point(X108,X109) ) ),
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)],[finish_point_defn])])])])])]) ).
cnf(c_0_22,plain,
( X1 = X2
| ordered_by(X3,X1,X2)
| ~ incident_o(X2,X3)
| ~ start_point(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ ordered_by(esk25_0,X1,esk26_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
fof(c_0_24,plain,
! [X131] : start_point(esk20_1(X131),X131),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[o4])]) ).
cnf(c_0_25,plain,
( incident_o(esk16_2(X1,X2),X2)
| finish_point(X1,X2)
| ~ incident_o(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( X1 = esk26_0
| ~ start_point(X1,esk25_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_23]) ).
cnf(c_0_27,plain,
start_point(esk20_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( finish_point(esk26_0,esk25_0)
| incident_o(esk16_2(esk26_0,esk25_0),esk25_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
esk20_1(esk25_0) = esk26_0,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( ~ ordered_by(esk25_0,esk26_0,X1)
| ~ incident_o(esk26_0,esk25_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_31,plain,
! [X3,X1] :
( inner_point(X3,X1)
<=> ( incident_c(X3,X1)
& ~ end_point(X3,X1) ) ),
inference(fof_simplification,[status(thm)],[inner_point_defn]) ).
fof(c_0_32,plain,
! [X49,X51,X52] :
( ( ~ open(X49)
| end_point(esk7_1(X49),X49) )
& ( ~ end_point(X52,X51)
| open(X51) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[open_defn])])])])]) ).
fof(c_0_33,plain,
! [X114,X116,X117] :
( open(esk17_1(X114))
& ( ~ incident_o(X116,X114)
| incident_c(X116,esk17_1(X114)) )
& ( ~ incident_c(X117,esk17_1(X114))
| incident_o(X117,X114) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[o2])])])])]) ).
cnf(c_0_34,negated_conjecture,
( X1 = esk16_2(esk26_0,esk25_0)
| finish_point(esk26_0,esk25_0)
| ordered_by(esk25_0,X1,esk16_2(esk26_0,esk25_0))
| ~ start_point(X1,esk25_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
start_point(esk26_0,esk25_0),
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
~ ordered_by(esk25_0,esk26_0,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_20])]) ).
fof(c_0_37,plain,
! [X35,X36] :
( ( incident_c(X35,X36)
| ~ inner_point(X35,X36) )
& ( ~ end_point(X35,X36)
| ~ inner_point(X35,X36) )
& ( ~ incident_c(X35,X36)
| end_point(X35,X36)
| inner_point(X35,X36) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])]) ).
fof(c_0_38,plain,
! [X60] : inner_point(esk8_1(X60),X60),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c3])]) ).
fof(c_0_39,plain,
! [X27,X28,X29,X30,X31,X32] :
( ( incident_c(X27,X28)
| ~ end_point(X27,X28) )
& ( ~ part_of(X29,X28)
| ~ part_of(X30,X28)
| ~ incident_c(X27,X29)
| ~ incident_c(X27,X30)
| part_of(X29,X30)
| part_of(X30,X29)
| ~ end_point(X27,X28) )
& ( part_of(esk3_2(X31,X32),X32)
| ~ incident_c(X31,X32)
| end_point(X31,X32) )
& ( part_of(esk4_2(X31,X32),X32)
| ~ incident_c(X31,X32)
| end_point(X31,X32) )
& ( incident_c(X31,esk3_2(X31,X32))
| ~ incident_c(X31,X32)
| end_point(X31,X32) )
& ( incident_c(X31,esk4_2(X31,X32))
| ~ incident_c(X31,X32)
| end_point(X31,X32) )
& ( ~ part_of(esk3_2(X31,X32),esk4_2(X31,X32))
| ~ incident_c(X31,X32)
| end_point(X31,X32) )
& ( ~ part_of(esk4_2(X31,X32),esk3_2(X31,X32))
| ~ incident_c(X31,X32)
| end_point(X31,X32) ) ),
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)],[end_point_defn])])])])])]) ).
cnf(c_0_40,plain,
( end_point(esk7_1(X1),X1)
| ~ open(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
open(esk17_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,plain,
( finish_point(X1,X2)
| X1 != esk16_2(X1,X2)
| ~ incident_o(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_43,negated_conjecture,
( esk16_2(esk26_0,esk25_0) = esk26_0
| finish_point(esk26_0,esk25_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_44,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,plain,
inner_point(esk8_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_46,plain,
! [X45,X46,X47] :
( ( ~ closed(X45)
| ~ end_point(X46,X45) )
& ( end_point(esk6_1(X47),X47)
| closed(X47) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[closed_defn])])])])]) ).
cnf(c_0_47,plain,
( incident_c(X1,X2)
| ~ end_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,plain,
end_point(esk7_1(esk17_1(X1)),esk17_1(X1)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
( X1 = X2
| ordered_by(X3,X2,X1)
| ~ incident_o(X2,X3)
| ~ finish_point(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_50,negated_conjecture,
finish_point(esk26_0,esk25_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_20])]) ).
cnf(c_0_51,plain,
( incident_o(X1,X2)
| ~ incident_c(X1,esk17_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_52,plain,
incident_c(esk8_1(X1),X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_53,plain,
( open(X2)
| ~ end_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_54,plain,
( end_point(esk6_1(X1),X1)
| closed(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_55,plain,
incident_c(esk7_1(esk17_1(X1)),esk17_1(X1)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_57,negated_conjecture,
( esk26_0 = X1
| ~ incident_o(X1,esk25_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_23]) ).
cnf(c_0_58,plain,
incident_o(esk8_1(esk17_1(X1)),X1),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,plain,
( open(X1)
| closed(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
incident_o(esk7_1(esk17_1(X1)),X1),
inference(spm,[status(thm)],[c_0_51,c_0_55]) ).
cnf(c_0_61,plain,
( ~ closed(X1)
| ~ end_point(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_62,plain,
~ end_point(esk8_1(X1),X1),
inference(spm,[status(thm)],[c_0_56,c_0_45]) ).
cnf(c_0_63,negated_conjecture,
esk8_1(esk17_1(esk25_0)) = esk26_0,
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
( closed(X1)
| end_point(esk7_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
esk7_1(esk17_1(esk25_0)) = esk26_0,
inference(spm,[status(thm)],[c_0_57,c_0_60]) ).
cnf(c_0_66,plain,
~ closed(esk17_1(X1)),
inference(spm,[status(thm)],[c_0_61,c_0_48]) ).
cnf(c_0_67,negated_conjecture,
~ end_point(esk26_0,esk17_1(esk25_0)),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : GEO127+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.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 06:29:26 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.p8gDBGPXJt/E---3.1_20120.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20198 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 511s (1) cores
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.45 # Starting new_bool_3 with 248s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 241s (1) cores
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.45 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 20208 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 511s (1) cores
% 0.16/0.45 # Preprocessing time : 0.003 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 28
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 88
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 88
% 0.16/0.45 # Processed clauses : 203
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 6
% 0.16/0.45 # ...remaining for further processing : 197
% 0.16/0.45 # Other redundant clauses eliminated : 7
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 1
% 0.16/0.45 # Backward-rewritten : 12
% 0.16/0.45 # Generated clauses : 198
% 0.16/0.45 # ...of the previous two non-redundant : 168
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 2
% 0.16/0.45 # Paramodulations : 191
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 7
% 0.16/0.45 # Total rewrite steps : 28
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 89
% 0.16/0.45 # Positive orientable unit clauses : 19
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 7
% 0.16/0.45 # Non-unit-clauses : 63
% 0.16/0.45 # Current number of unprocessed clauses: 139
% 0.16/0.45 # ...number of literals in the above : 422
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 101
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 2202
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 1132
% 0.16/0.45 # Non-unit clause-clause subsumptions : 8
% 0.16/0.45 # Unit Clause-clause subsumption calls : 120
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 6
% 0.16/0.45 # BW rewrite match successes : 3
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 8317
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.014 s
% 0.16/0.45 # System time : 0.006 s
% 0.16/0.45 # Total time : 0.020 s
% 0.16/0.45 # Maximum resident set size: 1992 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.064 s
% 0.16/0.45 # System time : 0.013 s
% 0.16/0.45 # Total time : 0.076 s
% 0.16/0.45 # Maximum resident set size: 1732 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------