TSTP Solution File: PLA031-1.002 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PLA031-1.002 : TPTP v8.2.0. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Tue May 21 02:19:17 EDT 2024
% Result : Unsatisfiable 8.64s 1.60s
% Output : CNFRefutation 8.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 20
% Syntax : Number of clauses : 87 ( 43 unt; 0 nHn; 87 RR)
% Number of literals : 143 ( 0 equ; 59 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-7 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 219 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(walk1,axiom,
( s(X1,X2,X3,X8,X5,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| ~ path(X4,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk1) ).
cnf(init,axiom,
s(s1,s1,s1,s1,s1,s2,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',init) ).
cnf(map7,axiom,
path(s1,p2_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map7) ).
cnf(walk2,axiom,
( s(X1,X2,X3,X4,X8,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| ~ path(X5,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk2) ).
cnf(map6,axiom,
path(p2_1,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map6) ).
cnf(board5,axiom,
( s(X1,X2,X3,X4,truck1,X5,X6)
| ~ s(X1,X2,X3,X4,X5,X5,X6)
| ~ neq(X4,truck1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board5) ).
cnf(neq29,axiom,
neq(s2,truck1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq29) ).
cnf(drive3,axiom,
( s(X1,X2,X3,X4,truck1,X7,X6)
| ~ s(X1,X2,X3,X4,truck1,X5,X6)
| ~ link(X5,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drive3) ).
cnf(load9,axiom,
( s(X1,X2,truck1,X4,X5,X3,X6)
| ~ s(X1,X2,X3,X4,X5,X3,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load9) ).
cnf(map12,axiom,
link(s2,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map12) ).
cnf(load10,axiom,
( s(X1,X2,X3,X4,X5,X3,X6)
| ~ s(X1,X2,truck1,X4,X5,X3,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load10) ).
cnf(map11,axiom,
link(s1,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map11) ).
cnf(load5,axiom,
( s(X1,truck1,X3,X4,X5,X2,X6)
| ~ s(X1,X2,X3,X4,X5,X2,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load5) ).
cnf(load6,axiom,
( s(X1,X2,X3,X4,X5,X2,X6)
| ~ s(X1,truck1,X3,X4,X5,X2,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load6) ).
cnf(load1,axiom,
( s(truck1,X2,X3,X4,X5,X1,X6)
| ~ s(X1,X2,X3,X4,X5,X1,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load1) ).
cnf(load2,axiom,
( s(X1,X2,X3,X4,X5,X1,X6)
| ~ s(truck1,X2,X3,X4,X5,X1,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load2) ).
cnf(map10,axiom,
link(s1,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map10) ).
cnf(map14,axiom,
link(s0,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map14) ).
cnf(map13,axiom,
link(s2,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map13) ).
cnf(goal,negated_conjecture,
~ s(s0,s0,s2,s2,X1,s2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_20,plain,
( s(X1,X2,X3,X8,X5,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| ~ path(X4,X8) ),
inference(fof_simplification,[status(thm)],[walk1]) ).
cnf(c_0_21,plain,
( s(X1,X2,X3,X8,X5,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| ~ path(X4,X8) ),
c_0_20 ).
cnf(c_0_22,axiom,
s(s1,s1,s1,s1,s1,s2,s0),
init ).
cnf(c_0_23,plain,
( s(s1,s1,s1,X1,s1,s2,s0)
| ~ path(s1,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,axiom,
path(s1,p2_1),
map7 ).
cnf(c_0_25,plain,
s(s1,s1,s1,p2_1,s1,s2,s0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( s(X1,X2,X3,X4,X8,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| ~ path(X5,X8) ),
inference(fof_simplification,[status(thm)],[walk2]) ).
cnf(c_0_27,plain,
( s(s1,s1,s1,X1,s1,s2,s0)
| ~ path(p2_1,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_28,axiom,
path(p2_1,s2),
map6 ).
cnf(c_0_29,plain,
( s(X1,X2,X3,X4,X8,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| ~ path(X5,X8) ),
c_0_26 ).
cnf(c_0_30,plain,
s(s1,s1,s1,s2,s1,s2,s0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( s(s1,s1,s1,s2,X1,s2,s0)
| ~ path(s1,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
( s(X1,X2,X3,X4,truck1,X5,X6)
| ~ s(X1,X2,X3,X4,X5,X5,X6)
| ~ neq(X4,truck1) ),
inference(fof_simplification,[status(thm)],[board5]) ).
cnf(c_0_33,plain,
s(s1,s1,s1,s2,p2_1,s2,s0),
inference(spm,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_34,plain,
( s(X1,X2,X3,X4,truck1,X5,X6)
| ~ s(X1,X2,X3,X4,X5,X5,X6)
| ~ neq(X4,truck1) ),
c_0_32 ).
cnf(c_0_35,axiom,
neq(s2,truck1),
neq29 ).
cnf(c_0_36,plain,
( s(s1,s1,s1,s2,X1,s2,s0)
| ~ path(p2_1,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_33]) ).
cnf(c_0_37,plain,
( s(X1,X2,X3,X4,truck1,X7,X6)
| ~ s(X1,X2,X3,X4,truck1,X5,X6)
| ~ link(X5,X7) ),
inference(fof_simplification,[status(thm)],[drive3]) ).
cnf(c_0_38,plain,
( s(X1,X2,X3,s2,truck1,X4,X5)
| ~ s(X1,X2,X3,s2,X4,X4,X5) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
s(s1,s1,s1,s2,s2,s2,s0),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_40,plain,
( s(X1,X2,X3,X4,truck1,X7,X6)
| ~ s(X1,X2,X3,X4,truck1,X5,X6)
| ~ link(X5,X7) ),
c_0_37 ).
cnf(c_0_41,plain,
s(s1,s1,s1,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
( s(X1,X2,truck1,X4,X5,X3,X6)
| ~ s(X1,X2,X3,X4,X5,X3,X6) ),
inference(fof_simplification,[status(thm)],[load9]) ).
cnf(c_0_43,plain,
( s(s1,s1,s1,s2,truck1,X1,s0)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,axiom,
link(s2,s1),
map12 ).
cnf(c_0_45,plain,
( s(X1,X2,truck1,X4,X5,X3,X6)
| ~ s(X1,X2,X3,X4,X5,X3,X6) ),
c_0_42 ).
cnf(c_0_46,plain,
s(s1,s1,s1,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
s(s1,s1,truck1,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
( s(X1,X2,X3,X4,X5,X3,X6)
| ~ s(X1,X2,truck1,X4,X5,X3,X6) ),
inference(fof_simplification,[status(thm)],[load10]) ).
cnf(c_0_49,plain,
( s(s1,s1,truck1,s2,truck1,X1,s0)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_47]) ).
cnf(c_0_50,axiom,
link(s1,s2),
map11 ).
cnf(c_0_51,plain,
( s(X1,X2,X3,X4,X5,X3,X6)
| ~ s(X1,X2,truck1,X4,X5,X3,X6) ),
c_0_48 ).
cnf(c_0_52,plain,
s(s1,s1,truck1,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
s(s1,s1,s2,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
( s(X1,truck1,X3,X4,X5,X2,X6)
| ~ s(X1,X2,X3,X4,X5,X2,X6) ),
inference(fof_simplification,[status(thm)],[load5]) ).
cnf(c_0_55,plain,
( s(s1,s1,s2,s2,truck1,X1,s0)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_53]) ).
cnf(c_0_56,plain,
( s(X1,truck1,X3,X4,X5,X2,X6)
| ~ s(X1,X2,X3,X4,X5,X2,X6) ),
c_0_54 ).
cnf(c_0_57,plain,
s(s1,s1,s2,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_55,c_0_44]) ).
cnf(c_0_58,plain,
s(s1,truck1,s2,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,plain,
( s(X1,X2,X3,X4,X5,X2,X6)
| ~ s(X1,truck1,X3,X4,X5,X2,X6) ),
inference(fof_simplification,[status(thm)],[load6]) ).
cnf(c_0_60,plain,
( s(s1,truck1,s2,s2,truck1,X1,s0)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_58]) ).
cnf(c_0_61,plain,
( s(X1,X2,X3,X4,X5,X2,X6)
| ~ s(X1,truck1,X3,X4,X5,X2,X6) ),
c_0_59 ).
cnf(c_0_62,plain,
s(s1,truck1,s2,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_60,c_0_50]) ).
cnf(c_0_63,plain,
s(s1,s2,s2,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_64,plain,
( s(truck1,X2,X3,X4,X5,X1,X6)
| ~ s(X1,X2,X3,X4,X5,X1,X6) ),
inference(fof_simplification,[status(thm)],[load1]) ).
cnf(c_0_65,plain,
( s(s1,s2,s2,s2,truck1,X1,s0)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_63]) ).
cnf(c_0_66,plain,
( s(truck1,X2,X3,X4,X5,X1,X6)
| ~ s(X1,X2,X3,X4,X5,X1,X6) ),
c_0_64 ).
cnf(c_0_67,plain,
s(s1,s2,s2,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_65,c_0_44]) ).
cnf(c_0_68,plain,
s(truck1,s2,s2,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_69,plain,
( s(X1,X2,X3,X4,X5,X1,X6)
| ~ s(truck1,X2,X3,X4,X5,X1,X6) ),
inference(fof_simplification,[status(thm)],[load2]) ).
cnf(c_0_70,plain,
( s(truck1,s2,s2,s2,truck1,X1,s0)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_68]) ).
cnf(c_0_71,axiom,
link(s1,s0),
map10 ).
cnf(c_0_72,plain,
( s(X1,X2,X3,X4,X5,X1,X6)
| ~ s(truck1,X2,X3,X4,X5,X1,X6) ),
c_0_69 ).
cnf(c_0_73,plain,
s(truck1,s2,s2,s2,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,plain,
s(s0,s2,s2,s2,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_75,plain,
( s(s0,s2,s2,s2,truck1,X1,s0)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_74]) ).
cnf(c_0_76,axiom,
link(s0,s2),
map14 ).
cnf(c_0_77,plain,
s(s0,s2,s2,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_78,plain,
s(s0,truck1,s2,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_56,c_0_77]) ).
cnf(c_0_79,plain,
( s(s0,truck1,s2,s2,truck1,X1,s0)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_78]) ).
cnf(c_0_80,axiom,
link(s2,s0),
map13 ).
cnf(c_0_81,plain,
s(s0,truck1,s2,s2,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_82,plain,
s(s0,s0,s2,s2,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_61,c_0_81]) ).
cnf(c_0_83,negated_conjecture,
~ s(s0,s0,s2,s2,X1,s2,X2),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_84,plain,
( s(s0,s0,s2,s2,truck1,X1,s0)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_82]) ).
cnf(c_0_85,negated_conjecture,
~ s(s0,s0,s2,s2,X1,s2,X2),
c_0_83 ).
cnf(c_0_86,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_76]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PLA031-1.002 : TPTP v8.2.0. Released v3.5.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n013.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 : Sat May 18 13:43:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/benchmark/theBenchmark.p
% 8.64/1.60 # Version: 3.1.0
% 8.64/1.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 8.64/1.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.64/1.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.64/1.60 # Starting new_bool_3 with 300s (1) cores
% 8.64/1.60 # Starting new_bool_1 with 300s (1) cores
% 8.64/1.60 # Starting sh5l with 300s (1) cores
% 8.64/1.60 # sh5l with pid 5010 completed with status 0
% 8.64/1.60 # Result found by sh5l
% 8.64/1.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 8.64/1.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.64/1.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.64/1.60 # Starting new_bool_3 with 300s (1) cores
% 8.64/1.60 # Starting new_bool_1 with 300s (1) cores
% 8.64/1.60 # Starting sh5l with 300s (1) cores
% 8.64/1.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.64/1.60 # Search class: FHUNF-FFMM00-SFFFFFNN
% 8.64/1.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.64/1.60 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 181s (1) cores
% 8.64/1.60 # G----_0021_C18_F1_SE_CS_SP_S4S with pid 5018 completed with status 0
% 8.64/1.60 # Result found by G----_0021_C18_F1_SE_CS_SP_S4S
% 8.64/1.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 8.64/1.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.64/1.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.64/1.60 # Starting new_bool_3 with 300s (1) cores
% 8.64/1.60 # Starting new_bool_1 with 300s (1) cores
% 8.64/1.60 # Starting sh5l with 300s (1) cores
% 8.64/1.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.64/1.60 # Search class: FHUNF-FFMM00-SFFFFFNN
% 8.64/1.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.64/1.60 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 181s (1) cores
% 8.64/1.60 # Preprocessing time : 0.001 s
% 8.64/1.60
% 8.64/1.60 # Proof found!
% 8.64/1.60 # SZS status Unsatisfiable
% 8.64/1.60 # SZS output start CNFRefutation
% See solution above
% 8.64/1.60 # Parsed axioms : 91
% 8.64/1.60 # Removed by relevancy pruning/SinE : 0
% 8.64/1.60 # Initial clauses : 91
% 8.64/1.60 # Removed in clause preprocessing : 0
% 8.64/1.60 # Initial clauses in saturation : 91
% 8.64/1.60 # Processed clauses : 12851
% 8.64/1.60 # ...of these trivial : 2745
% 8.64/1.60 # ...subsumed : 0
% 8.64/1.60 # ...remaining for further processing : 10106
% 8.64/1.60 # Other redundant clauses eliminated : 0
% 8.64/1.60 # Clauses deleted for lack of memory : 0
% 8.64/1.60 # Backward-subsumed : 0
% 8.64/1.60 # Backward-rewritten : 0
% 8.64/1.60 # Generated clauses : 40683
% 8.64/1.60 # ...of the previous two non-redundant : 32021
% 8.64/1.60 # ...aggressively subsumed : 0
% 8.64/1.60 # Contextual simplify-reflections : 0
% 8.64/1.60 # Paramodulations : 40683
% 8.64/1.60 # Factorizations : 0
% 8.64/1.60 # NegExts : 0
% 8.64/1.60 # Equation resolutions : 0
% 8.64/1.60 # Disequality decompositions : 0
% 8.64/1.60 # Total rewrite steps : 11405
% 8.64/1.60 # ...of those cached : 6235
% 8.64/1.60 # Propositional unsat checks : 0
% 8.64/1.60 # Propositional check models : 0
% 8.64/1.60 # Propositional check unsatisfiable : 0
% 8.64/1.60 # Propositional clauses : 0
% 8.64/1.60 # Propositional clauses after purity: 0
% 8.64/1.60 # Propositional unsat core size : 0
% 8.64/1.60 # Propositional preprocessing time : 0.000
% 8.64/1.60 # Propositional encoding time : 0.000
% 8.64/1.60 # Propositional solver time : 0.000
% 8.64/1.60 # Success case prop preproc time : 0.000
% 8.64/1.60 # Success case prop encoding time : 0.000
% 8.64/1.60 # Success case prop solver time : 0.000
% 8.64/1.60 # Current number of processed clauses : 10106
% 8.64/1.60 # Positive orientable unit clauses : 6038
% 8.64/1.60 # Positive unorientable unit clauses: 0
% 8.64/1.60 # Negative unit clauses : 8
% 8.64/1.60 # Non-unit-clauses : 4060
% 8.64/1.60 # Current number of unprocessed clauses: 19261
% 8.64/1.60 # ...number of literals in the above : 29714
% 8.64/1.60 # Current number of archived formulas : 0
% 8.64/1.60 # Current number of archived clauses : 0
% 8.64/1.60 # Clause-clause subsumption calls (NU) : 1511887
% 8.64/1.60 # Rec. Clause-clause subsumption calls : 1511047
% 8.64/1.60 # Non-unit clause-clause subsumptions : 0
% 8.64/1.60 # Unit Clause-clause subsumption calls : 3556670
% 8.64/1.60 # Rewrite failures with RHS unbound : 0
% 8.64/1.60 # BW rewrite match attempts : 1924712
% 8.64/1.60 # BW rewrite match successes : 0
% 8.64/1.60 # Condensation attempts : 0
% 8.64/1.60 # Condensation successes : 0
% 8.64/1.60 # Termbank termtop insertions : 530089
% 8.64/1.60 # Search garbage collected termcells : 96
% 8.64/1.60
% 8.64/1.60 # -------------------------------------------------
% 8.64/1.60 # User time : 1.062 s
% 8.64/1.60 # System time : 0.032 s
% 8.64/1.60 # Total time : 1.094 s
% 8.64/1.60 # Maximum resident set size: 1784 pages
% 8.64/1.60
% 8.64/1.60 # -------------------------------------------------
% 8.64/1.60 # User time : 1.063 s
% 8.64/1.60 # System time : 0.035 s
% 8.64/1.60 # Total time : 1.098 s
% 8.64/1.60 # Maximum resident set size: 1740 pages
% 8.64/1.60 % E---3.1 exiting
% 8.64/1.60 % E exiting
%------------------------------------------------------------------------------