TSTP Solution File: PLA031-1.005 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : PLA031-1.005 : TPTP v8.1.2. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:09:59 EDT 2023
% Result : Unsatisfiable 1196.68s 156.04s
% Output : CNFRefutation 1196.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 53
% Number of leaves : 27
% Syntax : Number of clauses : 108 ( 61 unt; 0 nHn; 108 RR)
% Number of literals : 168 ( 0 equ; 62 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-10 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 268 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(walk2,axiom,
( s(X1,X2,X3,X4,X5,X6,X11,X8,X9,X10)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10)
| ~ path(X7,X11) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',walk2) ).
cnf(init,axiom,
s(s0,s0,s1,s2,s2,s0,s2,s2,s1,s0),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',init) ).
cnf(map9,axiom,
path(s2,p2_0),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map9) ).
cnf(map12,axiom,
path(p2_0,s0),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map12) ).
cnf(walk3,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X11,X9,X10)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10)
| ~ path(X8,X11) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',walk3) ).
cnf(map7,axiom,
path(s2,p1_2),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map7) ).
cnf(map6,axiom,
path(p1_2,s1),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map6) ).
cnf(walk1,axiom,
( s(X1,X2,X3,X4,X5,X11,X7,X8,X9,X10)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10)
| ~ path(X6,X11) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',walk1) ).
cnf(map1,axiom,
path(s0,p0_1),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map1) ).
cnf(map4,axiom,
path(p0_1,s1),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map4) ).
cnf(board9,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,truck1,X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X8,X9)
| ~ neq(X6,truck1)
| ~ neq(X7,truck1) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',board9) ).
cnf(neq25,axiom,
neq(s1,truck1),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',neq25) ).
cnf(drive5,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,truck1,X10,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,truck1,X8,X9)
| ~ link(X8,X10) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',drive5) ).
cnf(map14,axiom,
link(s1,s0),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map14) ).
cnf(map16,axiom,
link(s0,s2),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map16) ).
cnf(load17,axiom,
( s(X1,X2,X3,X4,truck1,X6,X7,X8,X5,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X5,X9) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',load17) ).
cnf(map15,axiom,
link(s2,s0),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map15) ).
cnf(load18,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X8,X5,X9)
| ~ s(X1,X2,X3,X4,truck1,X6,X7,X8,X5,X9) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',load18) ).
cnf(load13,axiom,
( s(X1,X2,X3,truck1,X5,X6,X7,X8,X4,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X4,X9) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',load13) ).
cnf(map13,axiom,
link(s0,s1),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map13) ).
cnf(load14,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X8,X4,X9)
| ~ s(X1,X2,X3,truck1,X5,X6,X7,X8,X4,X9) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',load14) ).
cnf(load1,axiom,
( s(truck1,X2,X3,X4,X5,X6,X7,X8,X1,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X1,X9) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',load1) ).
cnf(load2,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X8,X1,X9)
| ~ s(truck1,X2,X3,X4,X5,X6,X7,X8,X1,X9) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',load2) ).
cnf(board10,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X8,X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,truck1,X8,X9) ),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',board10) ).
cnf(map3,axiom,
path(s1,p0_1),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map3) ).
cnf(map2,axiom,
path(p0_1,s0),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',map2) ).
cnf(goal,negated_conjecture,
~ s(s1,s0,s1,s1,s1,s0,s1,X1,s0,s0),
file('/export/starexec/sandbox/tmp/tmp.zGNzTC2KpL/E---3.1_4306.p',goal) ).
cnf(c_0_27,axiom,
( s(X1,X2,X3,X4,X5,X6,X11,X8,X9,X10)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10)
| ~ path(X7,X11) ),
walk2 ).
cnf(c_0_28,axiom,
s(s0,s0,s1,s2,s2,s0,s2,s2,s1,s0),
init ).
cnf(c_0_29,plain,
( s(s0,s0,s1,s2,s2,s0,X1,s2,s1,s0)
| ~ path(s2,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,axiom,
path(s2,p2_0),
map9 ).
cnf(c_0_31,plain,
s(s0,s0,s1,s2,s2,s0,p2_0,s2,s1,s0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
( s(s0,s0,s1,s2,s2,s0,X1,s2,s1,s0)
| ~ path(p2_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_33,axiom,
path(p2_0,s0),
map12 ).
cnf(c_0_34,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X11,X9,X10)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10)
| ~ path(X8,X11) ),
walk3 ).
cnf(c_0_35,plain,
s(s0,s0,s1,s2,s2,s0,s0,s2,s1,s0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( s(s0,s0,s1,s2,s2,s0,s0,X1,s1,s0)
| ~ path(s2,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,axiom,
path(s2,p1_2),
map7 ).
cnf(c_0_38,plain,
s(s0,s0,s1,s2,s2,s0,s0,p1_2,s1,s0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
( s(s0,s0,s1,s2,s2,s0,s0,X1,s1,s0)
| ~ path(p1_2,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_40,axiom,
path(p1_2,s1),
map6 ).
cnf(c_0_41,axiom,
( s(X1,X2,X3,X4,X5,X11,X7,X8,X9,X10)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10)
| ~ path(X6,X11) ),
walk1 ).
cnf(c_0_42,plain,
s(s0,s0,s1,s2,s2,s0,s0,s1,s1,s0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( s(s0,s0,s1,s2,s2,X1,s0,s1,s1,s0)
| ~ path(s0,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,axiom,
path(s0,p0_1),
map1 ).
cnf(c_0_45,plain,
s(s0,s0,s1,s2,s2,p0_1,s0,s1,s1,s0),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( s(s0,s0,s1,s2,s2,X1,s0,s1,s1,s0)
| ~ path(p0_1,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_45]) ).
cnf(c_0_47,axiom,
path(p0_1,s1),
map4 ).
cnf(c_0_48,plain,
s(s0,s0,s1,s2,s2,s1,s0,s1,s1,s0),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
( s(s0,s0,s1,s2,s2,s1,X1,s1,s1,s0)
| ~ path(s0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_48]) ).
cnf(c_0_50,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,truck1,X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X8,X9)
| ~ neq(X6,truck1)
| ~ neq(X7,truck1) ),
board9 ).
cnf(c_0_51,axiom,
neq(s1,truck1),
neq25 ).
cnf(c_0_52,plain,
s(s0,s0,s1,s2,s2,s1,p0_1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_49,c_0_44]) ).
cnf(c_0_53,plain,
( s(X1,X2,X3,X4,X5,X6,s1,truck1,X7,X8)
| ~ neq(X6,truck1)
| ~ s(X1,X2,X3,X4,X5,X6,s1,X7,X7,X8) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
( s(s0,s0,s1,s2,s2,s1,X1,s1,s1,s0)
| ~ path(p0_1,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_52]) ).
cnf(c_0_55,plain,
( s(X1,X2,X3,X4,X5,s1,s1,truck1,X6,X7)
| ~ s(X1,X2,X3,X4,X5,s1,s1,X6,X6,X7) ),
inference(spm,[status(thm)],[c_0_53,c_0_51]) ).
cnf(c_0_56,plain,
s(s0,s0,s1,s2,s2,s1,s1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_54,c_0_47]) ).
cnf(c_0_57,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,truck1,X10,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,truck1,X8,X9)
| ~ link(X8,X10) ),
drive5 ).
cnf(c_0_58,plain,
s(s0,s0,s1,s2,s2,s1,s1,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
( s(s0,s0,s1,s2,s2,s1,s1,truck1,X1,s0)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,axiom,
link(s1,s0),
map14 ).
cnf(c_0_61,plain,
s(s0,s0,s1,s2,s2,s1,s1,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,plain,
( s(s0,s0,s1,s2,s2,s1,s1,truck1,X1,s0)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_61]) ).
cnf(c_0_63,axiom,
link(s0,s2),
map16 ).
cnf(c_0_64,axiom,
( s(X1,X2,X3,X4,truck1,X6,X7,X8,X5,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X5,X9) ),
load17 ).
cnf(c_0_65,plain,
s(s0,s0,s1,s2,s2,s1,s1,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
s(s0,s0,s1,s2,truck1,s1,s1,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_67,plain,
( s(s0,s0,s1,s2,truck1,s1,s1,truck1,X1,s0)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_66]) ).
cnf(c_0_68,axiom,
link(s2,s0),
map15 ).
cnf(c_0_69,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X8,X5,X9)
| ~ s(X1,X2,X3,X4,truck1,X6,X7,X8,X5,X9) ),
load18 ).
cnf(c_0_70,plain,
s(s0,s0,s1,s2,truck1,s1,s1,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,plain,
s(s0,s0,s1,s2,s0,s1,s1,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_72,plain,
( s(s0,s0,s1,s2,s0,s1,s1,truck1,X1,s0)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_71]) ).
cnf(c_0_73,axiom,
( s(X1,X2,X3,truck1,X5,X6,X7,X8,X4,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X4,X9) ),
load13 ).
cnf(c_0_74,plain,
s(s0,s0,s1,s2,s0,s1,s1,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_72,c_0_63]) ).
cnf(c_0_75,plain,
s(s0,s0,s1,truck1,s0,s1,s1,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_76,plain,
( s(s0,s0,s1,truck1,s0,s1,s1,truck1,X1,s0)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_75]) ).
cnf(c_0_77,plain,
s(s0,s0,s1,truck1,s0,s1,s1,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_76,c_0_68]) ).
cnf(c_0_78,plain,
( s(s0,s0,s1,truck1,s0,s1,s1,truck1,X1,s0)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_77]) ).
cnf(c_0_79,axiom,
link(s0,s1),
map13 ).
cnf(c_0_80,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X8,X4,X9)
| ~ s(X1,X2,X3,truck1,X5,X6,X7,X8,X4,X9) ),
load14 ).
cnf(c_0_81,plain,
s(s0,s0,s1,truck1,s0,s1,s1,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_82,plain,
s(s0,s0,s1,s1,s0,s1,s1,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_83,plain,
( s(s0,s0,s1,s1,s0,s1,s1,truck1,X1,s0)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_82]) ).
cnf(c_0_84,plain,
s(s0,s0,s1,s1,s0,s1,s1,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_83,c_0_60]) ).
cnf(c_0_85,plain,
s(s0,s0,s1,s1,truck1,s1,s1,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_64,c_0_84]) ).
cnf(c_0_86,plain,
( s(s0,s0,s1,s1,truck1,s1,s1,truck1,X1,s0)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_85]) ).
cnf(c_0_87,plain,
s(s0,s0,s1,s1,truck1,s1,s1,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_86,c_0_79]) ).
cnf(c_0_88,plain,
s(s0,s0,s1,s1,s1,s1,s1,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_69,c_0_87]) ).
cnf(c_0_89,plain,
( s(s0,s0,s1,s1,s1,s1,s1,truck1,X1,s0)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_88]) ).
cnf(c_0_90,axiom,
( s(truck1,X2,X3,X4,X5,X6,X7,X8,X1,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X1,X9) ),
load1 ).
cnf(c_0_91,plain,
s(s0,s0,s1,s1,s1,s1,s1,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_89,c_0_60]) ).
cnf(c_0_92,plain,
s(truck1,s0,s1,s1,s1,s1,s1,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_93,plain,
( s(truck1,s0,s1,s1,s1,s1,s1,truck1,X1,s0)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_92]) ).
cnf(c_0_94,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X8,X1,X9)
| ~ s(truck1,X2,X3,X4,X5,X6,X7,X8,X1,X9) ),
load2 ).
cnf(c_0_95,plain,
s(truck1,s0,s1,s1,s1,s1,s1,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_93,c_0_79]) ).
cnf(c_0_96,plain,
s(s1,s0,s1,s1,s1,s1,s1,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_97,plain,
( s(s1,s0,s1,s1,s1,s1,s1,truck1,X1,s0)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_96]) ).
cnf(c_0_98,axiom,
( s(X1,X2,X3,X4,X5,X6,X7,X8,X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,truck1,X8,X9) ),
board10 ).
cnf(c_0_99,plain,
s(s1,s0,s1,s1,s1,s1,s1,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_97,c_0_60]) ).
cnf(c_0_100,plain,
s(s1,s0,s1,s1,s1,s1,s1,s0,s0,s0),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_101,plain,
( s(s1,s0,s1,s1,s1,X1,s1,s0,s0,s0)
| ~ path(s1,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_100]) ).
cnf(c_0_102,axiom,
path(s1,p0_1),
map3 ).
cnf(c_0_103,plain,
s(s1,s0,s1,s1,s1,p0_1,s1,s0,s0,s0),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_104,plain,
( s(s1,s0,s1,s1,s1,X1,s1,s0,s0,s0)
| ~ path(p0_1,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_103]) ).
cnf(c_0_105,axiom,
path(p0_1,s0),
map2 ).
cnf(c_0_106,negated_conjecture,
~ s(s1,s0,s1,s1,s1,s0,s1,X1,s0,s0),
goal ).
cnf(c_0_107,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : PLA031-1.005 : TPTP v8.1.2. Released v3.5.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n023.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 20:33:52 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.zGNzTC2KpL/E---3.1_4306.p
% 1196.68/156.04 # Version: 3.1pre001
% 1196.68/156.04 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1196.68/156.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1196.68/156.04 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1196.68/156.04 # Starting new_bool_3 with 300s (1) cores
% 1196.68/156.04 # Starting new_bool_1 with 300s (1) cores
% 1196.68/156.04 # Starting sh5l with 300s (1) cores
% 1196.68/156.04 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4384 completed with status 0
% 1196.68/156.04 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1196.68/156.04 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1196.68/156.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1196.68/156.04 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1196.68/156.04 # No SInE strategy applied
% 1196.68/156.04 # Search class: FHUNF-FFMM00-SFFFFFNN
% 1196.68/156.04 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1196.68/156.04 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 811s (1) cores
% 1196.68/156.04 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1196.68/156.04 # Starting new_bool_3 with 136s (1) cores
% 1196.68/156.04 # Starting new_bool_1 with 136s (1) cores
% 1196.68/156.04 # Starting sh5l with 136s (1) cores
% 1196.68/156.04 # new_bool_1 with pid 4393 completed with status 7
% 1196.68/156.04 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 130s (1) cores
% 1196.68/156.04 # new_bool_3 with pid 4392 completed with status 7
% 1196.68/156.04 # sh5l with pid 4394 completed with status 7
% 1196.68/156.04 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4390 completed with status 7
% 1196.68/156.04 # G----_0021_C18_F1_SE_CS_SP_S4S with pid 4388 completed with status 0
% 1196.68/156.04 # Result found by G----_0021_C18_F1_SE_CS_SP_S4S
% 1196.68/156.04 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1196.68/156.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1196.68/156.04 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1196.68/156.04 # No SInE strategy applied
% 1196.68/156.04 # Search class: FHUNF-FFMM00-SFFFFFNN
% 1196.68/156.04 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1196.68/156.04 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 811s (1) cores
% 1196.68/156.04 # Preprocessing time : 0.002 s
% 1196.68/156.04
% 1196.68/156.04 # Proof found!
% 1196.68/156.04 # SZS status Unsatisfiable
% 1196.68/156.04 # SZS output start CNFRefutation
% See solution above
% 1196.68/156.04 # Parsed axioms : 123
% 1196.68/156.04 # Removed by relevancy pruning/SinE : 0
% 1196.68/156.04 # Initial clauses : 123
% 1196.68/156.04 # Removed in clause preprocessing : 0
% 1196.68/156.04 # Initial clauses in saturation : 123
% 1196.68/156.04 # Processed clauses : 143261
% 1196.68/156.04 # ...of these trivial : 43407
% 1196.68/156.04 # ...subsumed : 0
% 1196.68/156.04 # ...remaining for further processing : 99854
% 1196.68/156.04 # Other redundant clauses eliminated : 0
% 1196.68/156.04 # Clauses deleted for lack of memory : 0
% 1196.68/156.04 # Backward-subsumed : 0
% 1196.68/156.04 # Backward-rewritten : 0
% 1196.68/156.04 # Generated clauses : 542872
% 1196.68/156.04 # ...of the previous two non-redundant : 440431
% 1196.68/156.04 # ...aggressively subsumed : 0
% 1196.68/156.04 # Contextual simplify-reflections : 0
% 1196.68/156.04 # Paramodulations : 542872
% 1196.68/156.04 # Factorizations : 0
% 1196.68/156.04 # NegExts : 0
% 1196.68/156.04 # Equation resolutions : 0
% 1196.68/156.04 # Total rewrite steps : 145847
% 1196.68/156.04 # Propositional unsat checks : 0
% 1196.68/156.04 # Propositional check models : 0
% 1196.68/156.04 # Propositional check unsatisfiable : 0
% 1196.68/156.04 # Propositional clauses : 0
% 1196.68/156.04 # Propositional clauses after purity: 0
% 1196.68/156.04 # Propositional unsat core size : 0
% 1196.68/156.04 # Propositional preprocessing time : 0.000
% 1196.68/156.04 # Propositional encoding time : 0.000
% 1196.68/156.04 # Propositional solver time : 0.000
% 1196.68/156.04 # Success case prop preproc time : 0.000
% 1196.68/156.04 # Success case prop encoding time : 0.000
% 1196.68/156.04 # Success case prop solver time : 0.000
% 1196.68/156.04 # Current number of processed clauses : 99854
% 1196.68/156.04 # Positive orientable unit clauses : 54569
% 1196.68/156.04 # Positive unorientable unit clauses: 0
% 1196.68/156.04 # Negative unit clauses : 9
% 1196.68/156.04 # Non-unit-clauses : 45276
% 1196.68/156.04 # Current number of unprocessed clauses: 297293
% 1196.68/156.04 # ...number of literals in the above : 418574
% 1196.68/156.04 # Current number of archived formulas : 0
% 1196.68/156.04 # Current number of archived clauses : 0
% 1196.68/156.04 # Clause-clause subsumption calls (NU) : 84898899
% 1196.68/156.04 # Rec. Clause-clause subsumption calls : 84898875
% 1196.68/156.04 # Non-unit clause-clause subsumptions : 0
% 1196.68/156.04 # Unit Clause-clause subsumption calls : 192475112
% 1196.68/156.04 # Rewrite failures with RHS unbound : 0
% 1196.68/156.04 # BW rewrite match attempts : 254711664
% 1196.68/156.04 # BW rewrite match successes : 0
% 1196.68/156.04 # Condensation attempts : 0
% 1196.68/156.04 # Condensation successes : 0
% 1196.68/156.04 # Termbank termtop insertions : 8658610
% 1196.68/156.04
% 1196.68/156.04 # -------------------------------------------------
% 1196.68/156.04 # User time : 712.088 s
% 1196.68/156.04 # System time : 1.302 s
% 1196.68/156.04 # Total time : 713.390 s
% 1196.68/156.04 # Maximum resident set size: 1816 pages
% 1196.68/156.04
% 1196.68/156.04 # -------------------------------------------------
% 1196.68/156.04 # User time : 730.872 s
% 1196.68/156.04 # System time : 1.521 s
% 1196.68/156.04 # Total time : 732.393 s
% 1196.68/156.04 # Maximum resident set size: 1748 pages
% 1196.68/156.04 % E---3.1 exiting
% 1196.68/156.04 % E---3.1 exiting
%------------------------------------------------------------------------------