TSTP Solution File: SET717+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET717+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:20:01 EDT 2024
% Result : Theorem 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 8 unt; 0 def)
% Number of atoms : 196 ( 9 equ)
% Maximal formula atoms : 55 ( 5 avg)
% Number of connectives : 254 ( 96 ~; 109 |; 39 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-7 aty)
% Number of variables : 116 ( 0 sgn 55 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII08,conjecture,
! [X6,X10,X1,X2,X11] :
( ( maps(X6,X1,X2)
& maps(X10,X2,X11)
& surjective(X6,X1,X2)
& surjective(X10,X2,X11) )
=> surjective(compose_function(X10,X6,X1,X2,X11),X1,X11) ),
file('/export/starexec/sandbox2/tmp/tmp.YJYJQymTBD/E---3.1_2498.p',thII08) ).
fof(maps,axiom,
! [X6,X1,X2] :
( maps(X6,X1,X2)
<=> ( ! [X3] :
( member(X3,X1)
=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5) ) )
& ! [X3,X7,X8] :
( ( member(X3,X1)
& member(X7,X2)
& member(X8,X2) )
=> ( ( apply(X6,X3,X7)
& apply(X6,X3,X8) )
=> X7 = X8 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YJYJQymTBD/E---3.1_2498.p',maps) ).
fof(surjective,axiom,
! [X6,X1,X2] :
( surjective(X6,X1,X2)
<=> ! [X5] :
( member(X5,X2)
=> ? [X4] :
( member(X4,X1)
& apply(X6,X4,X5) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YJYJQymTBD/E---3.1_2498.p',surjective) ).
fof(compose_function,axiom,
! [X10,X6,X1,X2,X11,X3,X12] :
( ( member(X3,X1)
& member(X12,X11) )
=> ( apply(compose_function(X10,X6,X1,X2,X11),X3,X12)
<=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5)
& apply(X10,X5,X12) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YJYJQymTBD/E---3.1_2498.p',compose_function) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X10,X1,X2,X11] :
( ( maps(X6,X1,X2)
& maps(X10,X2,X11)
& surjective(X6,X1,X2)
& surjective(X10,X2,X11) )
=> surjective(compose_function(X10,X6,X1,X2,X11),X1,X11) ),
inference(assume_negation,[status(cth)],[thII08]) ).
fof(c_0_5,plain,
! [X44,X45,X46,X47,X49,X50,X51,X52,X53,X54,X56] :
( ( member(esk9_4(X44,X45,X46,X47),X46)
| ~ member(X47,X45)
| ~ maps(X44,X45,X46) )
& ( apply(X44,X47,esk9_4(X44,X45,X46,X47))
| ~ member(X47,X45)
| ~ maps(X44,X45,X46) )
& ( ~ member(X49,X45)
| ~ member(X50,X46)
| ~ member(X51,X46)
| ~ apply(X44,X49,X50)
| ~ apply(X44,X49,X51)
| X50 = X51
| ~ maps(X44,X45,X46) )
& ( member(esk11_3(X52,X53,X54),X53)
| member(esk10_3(X52,X53,X54),X53)
| maps(X52,X53,X54) )
& ( member(esk12_3(X52,X53,X54),X54)
| member(esk10_3(X52,X53,X54),X53)
| maps(X52,X53,X54) )
& ( member(esk13_3(X52,X53,X54),X54)
| member(esk10_3(X52,X53,X54),X53)
| maps(X52,X53,X54) )
& ( apply(X52,esk11_3(X52,X53,X54),esk12_3(X52,X53,X54))
| member(esk10_3(X52,X53,X54),X53)
| maps(X52,X53,X54) )
& ( apply(X52,esk11_3(X52,X53,X54),esk13_3(X52,X53,X54))
| member(esk10_3(X52,X53,X54),X53)
| maps(X52,X53,X54) )
& ( esk12_3(X52,X53,X54) != esk13_3(X52,X53,X54)
| member(esk10_3(X52,X53,X54),X53)
| maps(X52,X53,X54) )
& ( member(esk11_3(X52,X53,X54),X53)
| ~ member(X56,X54)
| ~ apply(X52,esk10_3(X52,X53,X54),X56)
| maps(X52,X53,X54) )
& ( member(esk12_3(X52,X53,X54),X54)
| ~ member(X56,X54)
| ~ apply(X52,esk10_3(X52,X53,X54),X56)
| maps(X52,X53,X54) )
& ( member(esk13_3(X52,X53,X54),X54)
| ~ member(X56,X54)
| ~ apply(X52,esk10_3(X52,X53,X54),X56)
| maps(X52,X53,X54) )
& ( apply(X52,esk11_3(X52,X53,X54),esk12_3(X52,X53,X54))
| ~ member(X56,X54)
| ~ apply(X52,esk10_3(X52,X53,X54),X56)
| maps(X52,X53,X54) )
& ( apply(X52,esk11_3(X52,X53,X54),esk13_3(X52,X53,X54))
| ~ member(X56,X54)
| ~ apply(X52,esk10_3(X52,X53,X54),X56)
| maps(X52,X53,X54) )
& ( esk12_3(X52,X53,X54) != esk13_3(X52,X53,X54)
| ~ member(X56,X54)
| ~ apply(X52,esk10_3(X52,X53,X54),X56)
| maps(X52,X53,X54) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[maps])])])])])])]) ).
fof(c_0_6,negated_conjecture,
( maps(esk1_0,esk3_0,esk4_0)
& maps(esk2_0,esk4_0,esk5_0)
& surjective(esk1_0,esk3_0,esk4_0)
& surjective(esk2_0,esk4_0,esk5_0)
& ~ surjective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,plain,
( X3 = X5
| ~ member(X1,X2)
| ~ member(X3,X4)
| ~ member(X5,X4)
| ~ apply(X6,X1,X3)
| ~ apply(X6,X1,X5)
| ~ maps(X6,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
maps(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( apply(X1,X2,esk9_4(X1,X3,X4,X2))
| ~ member(X2,X3)
| ~ maps(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( member(esk9_4(X1,X2,X3,X4),X3)
| ~ member(X4,X2)
| ~ maps(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X22,X23,X24,X25,X27,X28,X29,X31] :
( ( member(esk6_4(X22,X23,X24,X25),X23)
| ~ member(X25,X24)
| ~ surjective(X22,X23,X24) )
& ( apply(X22,esk6_4(X22,X23,X24,X25),X25)
| ~ member(X25,X24)
| ~ surjective(X22,X23,X24) )
& ( member(esk7_3(X27,X28,X29),X29)
| surjective(X27,X28,X29) )
& ( ~ member(X31,X28)
| ~ apply(X27,X31,esk7_3(X27,X28,X29))
| surjective(X27,X28,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[surjective])])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( X1 = X2
| ~ apply(esk2_0,X3,X2)
| ~ apply(esk2_0,X3,X1)
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0)
| ~ member(X3,esk4_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( apply(esk2_0,X1,esk9_4(esk2_0,esk4_0,esk5_0,X1))
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( member(esk9_4(esk2_0,esk4_0,esk5_0,X1),esk5_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_15,plain,
( apply(X1,esk6_4(X1,X2,X3,X4),X4)
| ~ member(X4,X3)
| ~ surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
surjective(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( member(esk6_4(X1,X2,X3,X4),X2)
| ~ member(X4,X3)
| ~ surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( X1 = esk9_4(esk2_0,esk4_0,esk5_0,X2)
| ~ apply(esk2_0,X2,X1)
| ~ member(X1,esk5_0)
| ~ member(X2,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( apply(esk2_0,esk6_4(esk2_0,esk4_0,esk5_0,X1),X1)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( member(esk6_4(esk2_0,esk4_0,esk5_0,X1),esk4_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ surjective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,plain,
( member(esk7_3(X1,X2,X3),X3)
| surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( esk9_4(esk2_0,esk4_0,esk5_0,esk6_4(esk2_0,esk4_0,esk5_0,X1)) = X1
| ~ member(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
member(esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0),esk5_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_25,plain,
! [X35,X36,X37,X38,X39,X40,X41,X43] :
( ( member(esk8_7(X35,X36,X37,X38,X39,X40,X41),X38)
| ~ apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| ~ member(X40,X37)
| ~ member(X41,X39) )
& ( apply(X36,X40,esk8_7(X35,X36,X37,X38,X39,X40,X41))
| ~ apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| ~ member(X40,X37)
| ~ member(X41,X39) )
& ( apply(X35,esk8_7(X35,X36,X37,X38,X39,X40,X41),X41)
| ~ apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| ~ member(X40,X37)
| ~ member(X41,X39) )
& ( ~ member(X43,X38)
| ~ apply(X36,X40,X43)
| ~ apply(X35,X43,X41)
| apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| ~ member(X40,X37)
| ~ member(X41,X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[compose_function])])])])])]) ).
cnf(c_0_26,negated_conjecture,
esk9_4(esk2_0,esk4_0,esk5_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0))) = esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( apply(compose_function(X5,X3,X7,X2,X8),X4,X6)
| ~ member(X1,X2)
| ~ apply(X3,X4,X1)
| ~ apply(X5,X1,X6)
| ~ member(X4,X7)
| ~ member(X6,X8) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( apply(esk2_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)),esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0))
| ~ member(esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)),esk4_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
surjective(esk1_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,plain,
( surjective(X3,X2,X4)
| ~ member(X1,X2)
| ~ apply(X3,X1,esk7_3(X3,X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
( apply(compose_function(esk2_0,X1,X2,X3,X4),X5,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0))
| ~ apply(X1,X5,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)))
| ~ member(esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)),esk4_0)
| ~ member(esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)),X3)
| ~ member(esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0),X4)
| ~ member(X5,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( apply(esk1_0,esk6_4(esk1_0,esk3_0,esk4_0,X1),X1)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( ~ apply(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),X1,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0))
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( apply(compose_function(esk2_0,esk1_0,X1,X2,X3),esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0))),esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0))
| ~ member(esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0))),X1)
| ~ member(esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)),esk4_0)
| ~ member(esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)),X2)
| ~ member(esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0),X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( member(esk6_4(esk1_0,esk3_0,esk4_0,X1),esk3_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
~ member(esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)),esk4_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_24])]),c_0_35]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_20]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET717+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 10:23:29 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 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.YJYJQymTBD/E---3.1_2498.p
% 0.21/0.55 # Version: 3.1.0
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # new_bool_1 with pid 2617 completed with status 0
% 0.21/0.55 # Result found by new_bool_1
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.21/0.55 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.21/0.55 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 2620 completed with status 0
% 0.21/0.55 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.21/0.55 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.21/0.55 # Preprocessing time : 0.002 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Theorem
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 29
% 0.21/0.55 # Removed by relevancy pruning/SinE : 23
% 0.21/0.55 # Initial clauses : 38
% 0.21/0.55 # Removed in clause preprocessing : 0
% 0.21/0.55 # Initial clauses in saturation : 38
% 0.21/0.55 # Processed clauses : 119
% 0.21/0.55 # ...of these trivial : 0
% 0.21/0.55 # ...subsumed : 6
% 0.21/0.55 # ...remaining for further processing : 113
% 0.21/0.55 # Other redundant clauses eliminated : 0
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 4
% 0.21/0.55 # Backward-rewritten : 0
% 0.21/0.55 # Generated clauses : 139
% 0.21/0.55 # ...of the previous two non-redundant : 126
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 3
% 0.21/0.55 # Paramodulations : 139
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 0
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 18
% 0.21/0.55 # ...of those cached : 16
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 71
% 0.21/0.55 # Positive orientable unit clauses : 6
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 3
% 0.21/0.55 # Non-unit-clauses : 62
% 0.21/0.55 # Current number of unprocessed clauses: 82
% 0.21/0.55 # ...number of literals in the above : 445
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 42
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 1490
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 795
% 0.21/0.55 # Non-unit clause-clause subsumptions : 9
% 0.21/0.55 # Unit Clause-clause subsumption calls : 6
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 3
% 0.21/0.55 # BW rewrite match successes : 0
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 7368
% 0.21/0.55 # Search garbage collected termcells : 1057
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.016 s
% 0.21/0.55 # System time : 0.001 s
% 0.21/0.55 # Total time : 0.017 s
% 0.21/0.55 # Maximum resident set size: 1892 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.017 s
% 0.21/0.55 # System time : 0.006 s
% 0.21/0.55 # Total time : 0.023 s
% 0.21/0.55 # Maximum resident set size: 1756 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------