TSTP Solution File: MGT005-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : MGT005-2 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 00:39:53 EDT 2024
% Result : Unsatisfiable 1.10s 0.58s
% Output : CNFRefutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 24
% Syntax : Number of clauses : 77 ( 48 unt; 12 nHn; 77 RR)
% Number of literals : 298 ( 17 equ; 215 neg)
% Maximal clause size : 19 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 153 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a10_FOL_35,hypothesis,
( greater(X4,X6)
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ reorganization(X1,X2,X6)
| ~ reorganization(X3,X2,X4)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ complexity(X1,X8,X2)
| ~ complexity(X3,X9,X2)
| ~ greater(X9,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a10_FOL_35) ).
cnf(t5_plus_FOL_58,negated_conjecture,
complexity(sk6,sk13,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_58) ).
cnf(t5_plus_FOL_43,negated_conjecture,
organization(sk6,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_43) ).
cnf(t5_plus_FOL_45,negated_conjecture,
organization(sk6,sk17),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_45) ).
cnf(t5_plus_FOL_51,negated_conjecture,
reorganization(sk6,sk15,sk17),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_51) ).
cnf(t5_plus_FOL_42,negated_conjecture,
organization(sk5,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_42) ).
cnf(t5_plus_FOL_59,negated_conjecture,
greater(sk13,sk12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_59) ).
cnf(t5_plus_FOL_57,negated_conjecture,
complexity(sk5,sk12,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_57) ).
cnf(mp7_32,axiom,
( greater(X3,X2)
| ~ reorganization(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp7_32) ).
cnf(t5_plus_FOL_50,negated_conjecture,
reorganization(sk5,sk15,sk16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_50) ).
cnf(t5_plus_FOL_61,negated_conjecture,
sk14 = sk16,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_61) ).
cnf(t5_plus_FOL_53,negated_conjecture,
reorganization_type(sk6,sk7,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_53) ).
cnf(t5_plus_FOL_52,negated_conjecture,
reorganization_type(sk5,sk7,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_52) ).
cnf(mp13_31,axiom,
( organization(X1,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ greater(X4,X2)
| ~ greater(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp13_31) ).
cnf(t5_plus_FOL_47,negated_conjecture,
class(sk6,sk8,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_47) ).
cnf(t5_plus_FOL_46,negated_conjecture,
class(sk5,sk8,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_46) ).
cnf(a11_FOL_36,hypothesis,
( greater(X9,X10)
| X9 = X10
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X1,X4)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ survival_chance(X1,X6,X2)
| ~ survival_chance(X3,X6,X2)
| ~ reorganization(X1,X2,X4)
| ~ reorganization(X3,X2,X7)
| ~ reorganization_type(X1,X8,X2)
| ~ reorganization_type(X3,X8,X2)
| ~ survival_chance(X1,X9,X4)
| ~ survival_chance(X3,X10,X4)
| ~ complexity(X1,X11,X2)
| ~ complexity(X3,X12,X2)
| ~ greater(X12,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a11_FOL_36) ).
cnf(t5_plus_FOL_44,negated_conjecture,
organization(sk5,sk17),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_44) ).
cnf(t5_plus_FOL_49,negated_conjecture,
survival_chance(sk6,sk9,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_49) ).
cnf(t5_plus_FOL_48,negated_conjecture,
survival_chance(sk5,sk9,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_48) ).
cnf(t5_plus_FOL_56,negated_conjecture,
survival_chance(sk6,sk11,sk14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_56) ).
cnf(t5_plus_FOL_63,negated_conjecture,
sk10 != sk11,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_63) ).
cnf(t5_plus_FOL_62,negated_conjecture,
~ greater(sk10,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_62) ).
cnf(t5_plus_FOL_55,negated_conjecture,
survival_chance(sk5,sk10,sk14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_plus_FOL_55) ).
cnf(c_0_24,hypothesis,
( greater(X4,X6)
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ reorganization(X1,X2,X6)
| ~ reorganization(X3,X2,X4)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ complexity(X1,X8,X2)
| ~ complexity(X3,X9,X2)
| ~ greater(X9,X8) ),
inference(fof_simplification,[status(thm)],[a10_FOL_35]) ).
cnf(c_0_25,hypothesis,
( greater(X4,X6)
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ reorganization(X1,X2,X6)
| ~ reorganization(X3,X2,X4)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ complexity(X1,X8,X2)
| ~ complexity(X3,X9,X2)
| ~ greater(X9,X8) ),
c_0_24 ).
cnf(c_0_26,negated_conjecture,
complexity(sk6,sk13,sk15),
t5_plus_FOL_58 ).
cnf(c_0_27,negated_conjecture,
organization(sk6,sk15),
t5_plus_FOL_43 ).
cnf(c_0_28,negated_conjecture,
( greater(X1,X2)
| ~ complexity(X3,X4,sk15)
| ~ reorganization_type(sk6,X5,sk15)
| ~ reorganization_type(X3,X5,sk15)
| ~ class(sk6,X6,sk15)
| ~ class(X3,X6,sk15)
| ~ reorganization(sk6,sk15,X1)
| ~ reorganization(X3,sk15,X2)
| ~ organization(sk6,X1)
| ~ organization(X3,sk15)
| ~ greater(sk13,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
organization(sk6,sk17),
t5_plus_FOL_45 ).
cnf(c_0_30,negated_conjecture,
reorganization(sk6,sk15,sk17),
t5_plus_FOL_51 ).
cnf(c_0_31,negated_conjecture,
( greater(sk17,X1)
| ~ complexity(X2,X3,sk15)
| ~ reorganization_type(sk6,X4,sk15)
| ~ reorganization_type(X2,X4,sk15)
| ~ class(sk6,X5,sk15)
| ~ class(X2,X5,sk15)
| ~ reorganization(X2,sk15,X1)
| ~ organization(X2,sk15)
| ~ greater(sk13,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_32,negated_conjecture,
organization(sk5,sk15),
t5_plus_FOL_42 ).
cnf(c_0_33,negated_conjecture,
( greater(sk17,X1)
| ~ complexity(sk5,X2,sk15)
| ~ reorganization_type(sk6,X3,sk15)
| ~ reorganization_type(sk5,X3,sk15)
| ~ class(sk6,X4,sk15)
| ~ class(sk5,X4,sk15)
| ~ reorganization(sk5,sk15,X1)
| ~ greater(sk13,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
greater(sk13,sk12),
t5_plus_FOL_59 ).
cnf(c_0_35,negated_conjecture,
complexity(sk5,sk12,sk15),
t5_plus_FOL_57 ).
cnf(c_0_36,plain,
( greater(X3,X2)
| ~ reorganization(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[mp7_32]) ).
cnf(c_0_37,negated_conjecture,
reorganization(sk5,sk15,sk16),
t5_plus_FOL_50 ).
cnf(c_0_38,negated_conjecture,
sk14 = sk16,
t5_plus_FOL_61 ).
cnf(c_0_39,negated_conjecture,
( greater(sk17,X1)
| ~ reorganization_type(sk6,X2,sk15)
| ~ reorganization_type(sk5,X2,sk15)
| ~ class(sk6,X3,sk15)
| ~ class(sk5,X3,sk15)
| ~ reorganization(sk5,sk15,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,negated_conjecture,
reorganization_type(sk6,sk7,sk15),
t5_plus_FOL_53 ).
cnf(c_0_41,negated_conjecture,
reorganization_type(sk5,sk7,sk15),
t5_plus_FOL_52 ).
cnf(c_0_42,plain,
( organization(X1,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ greater(X4,X2)
| ~ greater(X3,X4) ),
inference(fof_simplification,[status(thm)],[mp13_31]) ).
cnf(c_0_43,plain,
( greater(X3,X2)
| ~ reorganization(X1,X2,X3) ),
c_0_36 ).
cnf(c_0_44,negated_conjecture,
reorganization(sk5,sk15,sk14),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( greater(sk17,X1)
| ~ class(sk6,X2,sk15)
| ~ class(sk5,X2,sk15)
| ~ reorganization(sk5,sk15,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_46,negated_conjecture,
class(sk6,sk8,sk15),
t5_plus_FOL_47 ).
cnf(c_0_47,negated_conjecture,
class(sk5,sk8,sk15),
t5_plus_FOL_46 ).
cnf(c_0_48,plain,
( organization(X1,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ greater(X4,X2)
| ~ greater(X3,X4) ),
c_0_42 ).
cnf(c_0_49,negated_conjecture,
greater(sk14,sk15),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( greater(sk17,X1)
| ~ reorganization(sk5,sk15,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_51,hypothesis,
( greater(X9,X10)
| X9 = X10
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X1,X4)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ survival_chance(X1,X6,X2)
| ~ survival_chance(X3,X6,X2)
| ~ reorganization(X1,X2,X4)
| ~ reorganization(X3,X2,X7)
| ~ reorganization_type(X1,X8,X2)
| ~ reorganization_type(X3,X8,X2)
| ~ survival_chance(X1,X9,X4)
| ~ survival_chance(X3,X10,X4)
| ~ complexity(X1,X11,X2)
| ~ complexity(X3,X12,X2)
| ~ greater(X12,X11) ),
inference(fof_simplification,[status(thm)],[a11_FOL_36]) ).
cnf(c_0_52,negated_conjecture,
( organization(X1,sk14)
| ~ organization(X1,sk15)
| ~ organization(X1,X2)
| ~ greater(X2,sk14) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
greater(sk17,sk14),
inference(spm,[status(thm)],[c_0_50,c_0_44]) ).
cnf(c_0_54,hypothesis,
( greater(X9,X10)
| X9 = X10
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X1,X4)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ survival_chance(X1,X6,X2)
| ~ survival_chance(X3,X6,X2)
| ~ reorganization(X1,X2,X4)
| ~ reorganization(X3,X2,X7)
| ~ reorganization_type(X1,X8,X2)
| ~ reorganization_type(X3,X8,X2)
| ~ survival_chance(X1,X9,X4)
| ~ survival_chance(X3,X10,X4)
| ~ complexity(X1,X11,X2)
| ~ complexity(X3,X12,X2)
| ~ greater(X12,X11) ),
c_0_51 ).
cnf(c_0_55,negated_conjecture,
( organization(X1,sk14)
| ~ organization(X1,sk15)
| ~ organization(X1,sk17) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ complexity(X3,X4,sk15)
| ~ reorganization_type(sk6,X5,sk15)
| ~ reorganization_type(X3,X5,sk15)
| ~ class(sk6,X6,sk15)
| ~ class(X3,X6,sk15)
| ~ reorganization(sk6,sk15,X7)
| ~ reorganization(X3,sk15,X8)
| ~ organization(sk6,X8)
| ~ organization(X3,sk15)
| ~ organization(X3,X8)
| ~ survival_chance(sk6,X9,sk15)
| ~ survival_chance(sk6,X2,X8)
| ~ survival_chance(X3,X9,sk15)
| ~ survival_chance(X3,X1,X8)
| ~ greater(sk13,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_26]),c_0_27])]) ).
cnf(c_0_57,negated_conjecture,
organization(sk6,sk14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_27]),c_0_29])]) ).
cnf(c_0_58,negated_conjecture,
organization(sk5,sk17),
t5_plus_FOL_44 ).
cnf(c_0_59,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ complexity(X3,X4,sk15)
| ~ reorganization_type(sk6,X5,sk15)
| ~ reorganization_type(X3,X5,sk15)
| ~ class(sk6,X6,sk15)
| ~ class(X3,X6,sk15)
| ~ reorganization(sk6,sk15,X7)
| ~ reorganization(X3,sk15,sk14)
| ~ organization(X3,sk15)
| ~ organization(X3,sk14)
| ~ survival_chance(sk6,X8,sk15)
| ~ survival_chance(sk6,X2,sk14)
| ~ survival_chance(X3,X8,sk15)
| ~ survival_chance(X3,X1,sk14)
| ~ greater(sk13,X4) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
organization(sk5,sk14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_32]),c_0_58])]) ).
cnf(c_0_61,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ complexity(sk5,X3,sk15)
| ~ reorganization_type(sk6,X4,sk15)
| ~ reorganization_type(sk5,X4,sk15)
| ~ class(sk6,X5,sk15)
| ~ class(sk5,X5,sk15)
| ~ reorganization(sk6,sk15,X6)
| ~ survival_chance(sk6,X7,sk15)
| ~ survival_chance(sk6,X2,sk14)
| ~ survival_chance(sk5,X7,sk15)
| ~ survival_chance(sk5,X1,sk14)
| ~ greater(sk13,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_32]),c_0_44]),c_0_60])]) ).
cnf(c_0_62,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ reorganization_type(sk6,X3,sk15)
| ~ reorganization_type(sk5,X3,sk15)
| ~ class(sk6,X4,sk15)
| ~ class(sk5,X4,sk15)
| ~ reorganization(sk6,sk15,X5)
| ~ survival_chance(sk6,X6,sk15)
| ~ survival_chance(sk6,X2,sk14)
| ~ survival_chance(sk5,X6,sk15)
| ~ survival_chance(sk5,X1,sk14) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_34]),c_0_35])]) ).
cnf(c_0_63,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ class(sk6,X3,sk15)
| ~ class(sk5,X3,sk15)
| ~ reorganization(sk6,sk15,X4)
| ~ survival_chance(sk6,X5,sk15)
| ~ survival_chance(sk6,X2,sk14)
| ~ survival_chance(sk5,X5,sk15)
| ~ survival_chance(sk5,X1,sk14) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_40]),c_0_41])]) ).
cnf(c_0_64,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ reorganization(sk6,sk15,X3)
| ~ survival_chance(sk6,X4,sk15)
| ~ survival_chance(sk6,X2,sk14)
| ~ survival_chance(sk5,X4,sk15)
| ~ survival_chance(sk5,X1,sk14) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_46]),c_0_47])]) ).
cnf(c_0_65,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ survival_chance(sk6,X3,sk15)
| ~ survival_chance(sk6,X2,sk14)
| ~ survival_chance(sk5,X3,sk15)
| ~ survival_chance(sk5,X1,sk14) ),
inference(spm,[status(thm)],[c_0_64,c_0_30]) ).
cnf(c_0_66,negated_conjecture,
survival_chance(sk6,sk9,sk15),
t5_plus_FOL_49 ).
cnf(c_0_67,negated_conjecture,
survival_chance(sk5,sk9,sk15),
t5_plus_FOL_48 ).
cnf(c_0_68,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ survival_chance(sk6,X2,sk14)
| ~ survival_chance(sk5,X1,sk14) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_69,negated_conjecture,
survival_chance(sk6,sk11,sk14),
t5_plus_FOL_56 ).
cnf(c_0_70,negated_conjecture,
sk10 != sk11,
inference(fof_simplification,[status(thm)],[t5_plus_FOL_63]) ).
cnf(c_0_71,negated_conjecture,
~ greater(sk10,sk11),
inference(fof_simplification,[status(thm)],[t5_plus_FOL_62]) ).
cnf(c_0_72,negated_conjecture,
( X1 = sk11
| greater(X1,sk11)
| ~ survival_chance(sk5,X1,sk14) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
survival_chance(sk5,sk10,sk14),
t5_plus_FOL_55 ).
cnf(c_0_74,negated_conjecture,
sk10 != sk11,
c_0_70 ).
cnf(c_0_75,negated_conjecture,
~ greater(sk10,sk11),
c_0_71 ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT005-2 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 00:06:07 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.10/0.58 # Version: 3.1.0
% 1.10/0.58 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.10/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.10/0.58 # Starting new_bool_3 with 300s (1) cores
% 1.10/0.58 # Starting new_bool_1 with 300s (1) cores
% 1.10/0.58 # Starting sh5l with 300s (1) cores
% 1.10/0.58 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 4652 completed with status 0
% 1.10/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.10/0.58 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.10/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.10/0.58 # No SInE strategy applied
% 1.10/0.58 # Search class: FGHSF-FFMM33-SFFFFFNN
% 1.10/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.10/0.58 # Starting G-E--_301_C18_F1_URBAN_S0Y with 811s (1) cores
% 1.10/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.10/0.58 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 1.10/0.58 # Starting new_bool_3 with 136s (1) cores
% 1.10/0.58 # Starting new_bool_1 with 136s (1) cores
% 1.10/0.58 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 4657 completed with status 0
% 1.10/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.10/0.58 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.10/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.10/0.58 # No SInE strategy applied
% 1.10/0.58 # Search class: FGHSF-FFMM33-SFFFFFNN
% 1.10/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.10/0.58 # Starting G-E--_301_C18_F1_URBAN_S0Y with 811s (1) cores
% 1.10/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.10/0.58 # Preprocessing time : 0.002 s
% 1.10/0.58 # Presaturation interreduction done
% 1.10/0.58
% 1.10/0.58 # Proof found!
% 1.10/0.58 # SZS status Unsatisfiable
% 1.10/0.58 # SZS output start CNFRefutation
% See solution above
% 1.10/0.58 # Parsed axioms : 38
% 1.10/0.58 # Removed by relevancy pruning/SinE : 0
% 1.10/0.58 # Initial clauses : 38
% 1.10/0.58 # Removed in clause preprocessing : 0
% 1.10/0.58 # Initial clauses in saturation : 38
% 1.10/0.58 # Processed clauses : 718
% 1.10/0.58 # ...of these trivial : 0
% 1.10/0.58 # ...subsumed : 171
% 1.10/0.58 # ...remaining for further processing : 547
% 1.10/0.58 # Other redundant clauses eliminated : 1
% 1.10/0.58 # Clauses deleted for lack of memory : 0
% 1.10/0.58 # Backward-subsumed : 10
% 1.10/0.58 # Backward-rewritten : 13
% 1.10/0.58 # Generated clauses : 694
% 1.10/0.58 # ...of the previous two non-redundant : 686
% 1.10/0.58 # ...aggressively subsumed : 0
% 1.10/0.58 # Contextual simplify-reflections : 2
% 1.10/0.58 # Paramodulations : 693
% 1.10/0.58 # Factorizations : 0
% 1.10/0.58 # NegExts : 0
% 1.10/0.58 # Equation resolutions : 1
% 1.10/0.58 # Disequality decompositions : 0
% 1.10/0.58 # Total rewrite steps : 131
% 1.10/0.58 # ...of those cached : 105
% 1.10/0.58 # Propositional unsat checks : 0
% 1.10/0.58 # Propositional check models : 0
% 1.10/0.58 # Propositional check unsatisfiable : 0
% 1.10/0.58 # Propositional clauses : 0
% 1.10/0.58 # Propositional clauses after purity: 0
% 1.10/0.58 # Propositional unsat core size : 0
% 1.10/0.58 # Propositional preprocessing time : 0.000
% 1.10/0.58 # Propositional encoding time : 0.000
% 1.10/0.58 # Propositional solver time : 0.000
% 1.10/0.58 # Success case prop preproc time : 0.000
% 1.10/0.58 # Success case prop encoding time : 0.000
% 1.10/0.58 # Success case prop solver time : 0.000
% 1.10/0.58 # Current number of processed clauses : 485
% 1.10/0.58 # Positive orientable unit clauses : 44
% 1.10/0.58 # Positive unorientable unit clauses: 0
% 1.10/0.58 # Negative unit clauses : 22
% 1.10/0.58 # Non-unit-clauses : 419
% 1.10/0.58 # Current number of unprocessed clauses: 36
% 1.10/0.58 # ...number of literals in the above : 238
% 1.10/0.58 # Current number of archived formulas : 0
% 1.10/0.58 # Current number of archived clauses : 61
% 1.10/0.58 # Clause-clause subsumption calls (NU) : 37301
% 1.10/0.58 # Rec. Clause-clause subsumption calls : 14243
% 1.10/0.58 # Non-unit clause-clause subsumptions : 12
% 1.10/0.58 # Unit Clause-clause subsumption calls : 577
% 1.10/0.58 # Rewrite failures with RHS unbound : 0
% 1.10/0.58 # BW rewrite match attempts : 2
% 1.10/0.58 # BW rewrite match successes : 2
% 1.10/0.58 # Condensation attempts : 0
% 1.10/0.58 # Condensation successes : 0
% 1.10/0.58 # Termbank termtop insertions : 31685
% 1.10/0.58 # Search garbage collected termcells : 182
% 1.10/0.58
% 1.10/0.58 # -------------------------------------------------
% 1.10/0.58 # User time : 0.096 s
% 1.10/0.58 # System time : 0.004 s
% 1.10/0.58 # Total time : 0.100 s
% 1.10/0.58 # Maximum resident set size: 1760 pages
% 1.10/0.58
% 1.10/0.58 # -------------------------------------------------
% 1.10/0.58 # User time : 0.467 s
% 1.10/0.58 # System time : 0.009 s
% 1.10/0.58 # Total time : 0.476 s
% 1.10/0.58 # Maximum resident set size: 1736 pages
% 1.10/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------