TSTP Solution File: GRP417-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP417-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Mon May 20 20:56:25 EDT 2024
% Result : Unsatisfiable 4.69s 1.25s
% Output : CNFRefutation 4.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 2
% Syntax : Number of clauses : 67 ( 67 unt; 0 nHn; 9 RR)
% Number of literals : 67 ( 66 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 140 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1)))))) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1)))))) = X3,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,X3))),inverse(multiply(inverse(X1),X1)))))) = multiply(X4,inverse(multiply(inverse(multiply(inverse(multiply(X5,X4)),multiply(X5,inverse(X3)))),inverse(multiply(inverse(X4),X4))))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(a3,inverse(multiply(inverse(multiply(inverse(multiply(a3,a3)),multiply(a3,inverse(inverse(X1))))),inverse(multiply(inverse(a3),a3))))) = X1,
inference(rw,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1))))) = multiply(X4,inverse(multiply(inverse(multiply(inverse(multiply(X5,X4)),multiply(X5,inverse(X3)))),inverse(multiply(inverse(X4),X4))))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(inverse(X3))))),inverse(multiply(inverse(X1),X1))))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),X3)),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,inverse(inverse(X3))))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_6]),c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),inverse(multiply(inverse(X2),X2)))))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_6]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(a3,a3)),multiply(a3,inverse(inverse(multiply(a3,inverse(X2))))))),inverse(multiply(inverse(a3),a3))))) = multiply(X1,inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_3]),c_0_3]),c_0_7]) ).
cnf(c_0_10,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(a3,a3)),multiply(a3,X2))),inverse(multiply(inverse(a3),a3))))) = multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X3,a3)),multiply(X3,X2))),inverse(multiply(inverse(a3),a3))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_3]),c_0_3]),c_0_6]) ).
cnf(c_0_11,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(a3,a3)),multiply(a3,inverse(inverse(multiply(a3,X2)))))),inverse(multiply(inverse(a3),a3))))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_10]),c_0_7]) ).
cnf(c_0_12,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(a3,inverse(multiply(inverse(multiply(inverse(multiply(a3,a3)),multiply(a3,inverse(X3)))),inverse(multiply(inverse(a3),a3))))))),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,inverse(X3)))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_3]),c_0_6]) ).
cnf(c_0_13,plain,
multiply(inverse(multiply(inverse(multiply(a3,a3)),multiply(a3,inverse(inverse(multiply(a3,inverse(X1))))))),inverse(multiply(inverse(a3),a3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_9]),c_0_3]),c_0_6]),c_0_6]) ).
cnf(c_0_14,plain,
inverse(multiply(inverse(multiply(inverse(multiply(a3,a3)),multiply(a3,inverse(inverse(multiply(a3,X1)))))),inverse(multiply(inverse(a3),a3)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_8]) ).
cnf(c_0_15,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X2),X2))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,inverse(X3)))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_7]),c_0_13]) ).
cnf(c_0_16,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,inverse(X3))))))),inverse(multiply(inverse(X2),X2))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_8]),c_0_7]),c_0_13]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X1,a3)),multiply(X1,inverse(inverse(multiply(a3,X2)))))),inverse(multiply(inverse(a3),a3)))) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
inverse(inverse(multiply(a3,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),a3)),X3)),inverse(multiply(inverse(a3),a3))))))) = multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(X3),inverse(multiply(inverse(X2),X2)))))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_7]) ).
cnf(c_0_19,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,inverse(inverse(multiply(X3,inverse(X4))))))),X1)),X4)),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(X3),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_16]),c_0_6]) ).
cnf(c_0_20,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))),inverse(multiply(inverse(X2),X2))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,X3))),inverse(multiply(inverse(X2),X2))),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_21,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(X3),inverse(multiply(inverse(X2),X2))))))))) = X3,
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_22,plain,
inverse(multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(inverse(multiply(inverse(X1),X1))),inverse(multiply(inverse(X1),X1)))))))) = multiply(inverse(X1),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]) ).
cnf(c_0_23,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X2)))),multiply(X1,inverse(multiply(inverse(X2),X2)))) = multiply(inverse(X3),X3),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_25,plain,
inverse(inverse(multiply(a3,inverse(multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(a3),a3))))))) = a3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_24]),c_0_8]) ).
cnf(c_0_26,plain,
inverse(inverse(multiply(a3,inverse(multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(X2),X2))))))) = a3,
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_27,plain,
multiply(inverse(multiply(inverse(a3),a3)),inverse(multiply(inverse(a3),a3))) = multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_26]),c_0_24]) ).
cnf(c_0_28,plain,
multiply(inverse(inverse(X1)),inverse(multiply(inverse(multiply(inverse(a3),a3)),inverse(multiply(inverse(a3),a3))))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_27]) ).
cnf(c_0_29,plain,
multiply(inverse(multiply(inverse(a3),a3)),inverse(multiply(inverse(a3),a3))) = multiply(inverse(X1),X1),
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_30,plain,
inverse(multiply(inverse(a3),a3)) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_29]),c_0_26]) ).
cnf(c_0_31,plain,
inverse(multiply(inverse(X1),X1)) = multiply(inverse(X1),X1),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_32,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_21]) ).
cnf(c_0_33,plain,
multiply(multiply(inverse(X1),X1),multiply(inverse(a3),a3)) = multiply(inverse(X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31]),c_0_31]),c_0_29]),c_0_31]) ).
cnf(c_0_34,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(inverse(X3),X2)),multiply(inverse(X4),X4)),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_35,plain,
multiply(inverse(inverse(X1)),multiply(inverse(a3),a3)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31]),c_0_33]),c_0_31]) ).
cnf(c_0_36,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X3,inverse(multiply(inverse(multiply(inverse(multiply(X4,X3)),multiply(X4,inverse(X5)))),inverse(multiply(inverse(X3),X3))))))),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(multiply(inverse(multiply(X6,X2)),multiply(X6,inverse(X5)))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_6]) ).
cnf(c_0_37,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(a3,X2)),multiply(a3,multiply(X3,X1)))))) = multiply(inverse(multiply(a3,multiply(X4,inverse(inverse(X2))))),multiply(a3,multiply(X4,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_31]),c_0_34]),c_0_31]),c_0_34]) ).
cnf(c_0_38,plain,
multiply(inverse(multiply(a3,multiply(X1,inverse(inverse(multiply(X2,inverse(X3))))))),multiply(a3,multiply(X1,X2))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_31]),c_0_34]) ).
cnf(c_0_39,plain,
multiply(multiply(inverse(X1),X1),multiply(inverse(X1),X2)) = multiply(inverse(multiply(a3,X1)),multiply(a3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_34]) ).
cnf(c_0_40,plain,
multiply(inverse(inverse(X1)),multiply(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_24]) ).
cnf(c_0_41,plain,
multiply(multiply(inverse(X1),X1),multiply(inverse(X2),X2)) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_24]) ).
cnf(c_0_42,plain,
multiply(inverse(multiply(a3,multiply(a3,inverse(X1)))),multiply(a3,multiply(a3,X2))) = multiply(inverse(multiply(a3,multiply(X3,inverse(X1)))),multiply(a3,multiply(X3,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_31]),c_0_34]),c_0_31]),c_0_34]),c_0_31]),c_0_34]),c_0_37]),c_0_37]),c_0_38]) ).
cnf(c_0_43,plain,
multiply(multiply(inverse(X1),X1),multiply(inverse(X2),X3)) = multiply(inverse(multiply(a3,X2)),multiply(a3,X3)),
inference(spm,[status(thm)],[c_0_39,c_0_24]) ).
cnf(c_0_44,plain,
multiply(inverse(a3),multiply(inverse(X1),X1)) = inverse(multiply(a3,multiply(inverse(a3),a3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_26]),c_0_31]),c_0_31]),c_0_41]),c_0_31]) ).
cnf(c_0_45,plain,
inverse(multiply(inverse(a3),multiply(inverse(a3),a3))) = a3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_42]),c_0_31]),c_0_31]),c_0_43]),c_0_24]),c_0_31]),c_0_44]) ).
cnf(c_0_46,plain,
inverse(multiply(inverse(a3),multiply(inverse(X1),X1))) = a3,
inference(spm,[status(thm)],[c_0_45,c_0_24]) ).
cnf(c_0_47,plain,
multiply(inverse(multiply(X1,multiply(inverse(X2),X2))),multiply(X1,X3)) = multiply(a3,multiply(inverse(a3),X3)),
inference(spm,[status(thm)],[c_0_32,c_0_46]) ).
cnf(c_0_48,plain,
multiply(inverse(X1),multiply(inverse(inverse(X1)),X2)) = multiply(a3,multiply(inverse(a3),X2)),
inference(spm,[status(thm)],[c_0_47,c_0_40]) ).
cnf(c_0_49,plain,
multiply(a3,multiply(inverse(a3),inverse(inverse(X1)))) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_48]) ).
cnf(c_0_50,plain,
multiply(inverse(multiply(inverse(inverse(X1)),inverse(X2))),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_49]),c_0_49]) ).
cnf(c_0_51,plain,
multiply(a3,multiply(inverse(a3),multiply(inverse(X1),X1))) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_24,c_0_46]) ).
cnf(c_0_52,plain,
inverse(multiply(a3,multiply(inverse(a3),inverse(a3)))) = a3,
inference(spm,[status(thm)],[c_0_46,c_0_48]) ).
cnf(c_0_53,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_24]),c_0_31]) ).
cnf(c_0_54,plain,
multiply(a3,multiply(a3,multiply(inverse(a3),inverse(a3)))) = multiply(inverse(a3),a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_51]) ).
cnf(c_0_55,plain,
multiply(a3,multiply(inverse(a3),X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_53]),c_0_31]),c_0_53]),c_0_53]) ).
cnf(c_0_56,plain,
multiply(inverse(a3),a3) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_49,c_0_55]) ).
cnf(c_0_58,plain,
multiply(inverse(X1),X1) = multiply(a3,inverse(a3)),
inference(spm,[status(thm)],[c_0_24,c_0_56]) ).
cnf(c_0_59,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_57]),c_0_57]) ).
cnf(c_0_60,plain,
multiply(inverse(multiply(a3,X1)),multiply(a3,X2)) = multiply(inverse(X1),X2),
inference(rw,[status(thm)],[c_0_43,c_0_53]) ).
cnf(c_0_61,plain,
multiply(X1,multiply(a3,inverse(a3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_57]),c_0_58]) ).
cnf(c_0_62,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_63,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_59]),c_0_57]),c_0_57]),c_0_60]),c_0_31]),c_0_58]),c_0_61]),c_0_57]) ).
cnf(c_0_64,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_62 ).
cnf(c_0_65,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_21]),c_0_57]),c_0_31]),c_0_58]),c_0_61]),c_0_57]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP417-1 : TPTP v8.2.0. Released v2.6.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 04:16:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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
% 4.69/1.25 # Version: 3.1.0
% 4.69/1.25 # Preprocessing class: FSSSSMSSSSSNFFN.
% 4.69/1.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.69/1.25 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.69/1.25 # Starting new_bool_3 with 300s (1) cores
% 4.69/1.25 # Starting new_bool_1 with 300s (1) cores
% 4.69/1.25 # Starting sh5l with 300s (1) cores
% 4.69/1.25 # new_bool_3 with pid 28849 completed with status 8
% 4.69/1.25 # new_bool_1 with pid 28850 completed with status 8
% 4.69/1.25 # sh5l with pid 28851 completed with status 0
% 4.69/1.25 # Result found by sh5l
% 4.69/1.25 # Preprocessing class: FSSSSMSSSSSNFFN.
% 4.69/1.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.69/1.25 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.69/1.25 # Starting new_bool_3 with 300s (1) cores
% 4.69/1.25 # Starting new_bool_1 with 300s (1) cores
% 4.69/1.25 # Starting sh5l with 300s (1) cores
% 4.69/1.25 # SinE strategy is gf500_gu_R04_F100_L20000
% 4.69/1.25 # Search class: FUUPF-FFSF21-DFFFFFNN
% 4.69/1.25 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.69/1.25 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 4.69/1.25 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28859 completed with status 0
% 4.69/1.25 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.69/1.25 # Preprocessing class: FSSSSMSSSSSNFFN.
% 4.69/1.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.69/1.25 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.69/1.25 # Starting new_bool_3 with 300s (1) cores
% 4.69/1.25 # Starting new_bool_1 with 300s (1) cores
% 4.69/1.25 # Starting sh5l with 300s (1) cores
% 4.69/1.25 # SinE strategy is gf500_gu_R04_F100_L20000
% 4.69/1.25 # Search class: FUUPF-FFSF21-DFFFFFNN
% 4.69/1.25 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.69/1.25 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 4.69/1.25 # Preprocessing time : 0.001 s
% 4.69/1.25 # Presaturation interreduction done
% 4.69/1.25
% 4.69/1.25 # Proof found!
% 4.69/1.25 # SZS status Unsatisfiable
% 4.69/1.25 # SZS output start CNFRefutation
% See solution above
% 4.69/1.25 # Parsed axioms : 2
% 4.69/1.25 # Removed by relevancy pruning/SinE : 0
% 4.69/1.25 # Initial clauses : 2
% 4.69/1.25 # Removed in clause preprocessing : 0
% 4.69/1.25 # Initial clauses in saturation : 2
% 4.69/1.25 # Processed clauses : 437
% 4.69/1.25 # ...of these trivial : 128
% 4.69/1.25 # ...subsumed : 191
% 4.69/1.25 # ...remaining for further processing : 118
% 4.69/1.25 # Other redundant clauses eliminated : 0
% 4.69/1.25 # Clauses deleted for lack of memory : 0
% 4.69/1.25 # Backward-subsumed : 8
% 4.69/1.25 # Backward-rewritten : 92
% 4.69/1.25 # Generated clauses : 20088
% 4.69/1.25 # ...of the previous two non-redundant : 19362
% 4.69/1.25 # ...aggressively subsumed : 0
% 4.69/1.25 # Contextual simplify-reflections : 0
% 4.69/1.25 # Paramodulations : 20088
% 4.69/1.25 # Factorizations : 0
% 4.69/1.25 # NegExts : 0
% 4.69/1.25 # Equation resolutions : 0
% 4.69/1.25 # Disequality decompositions : 0
% 4.69/1.25 # Total rewrite steps : 45422
% 4.69/1.25 # ...of those cached : 41967
% 4.69/1.25 # Propositional unsat checks : 0
% 4.69/1.25 # Propositional check models : 0
% 4.69/1.25 # Propositional check unsatisfiable : 0
% 4.69/1.25 # Propositional clauses : 0
% 4.69/1.25 # Propositional clauses after purity: 0
% 4.69/1.25 # Propositional unsat core size : 0
% 4.69/1.25 # Propositional preprocessing time : 0.000
% 4.69/1.25 # Propositional encoding time : 0.000
% 4.69/1.25 # Propositional solver time : 0.000
% 4.69/1.25 # Success case prop preproc time : 0.000
% 4.69/1.25 # Success case prop encoding time : 0.000
% 4.69/1.25 # Success case prop solver time : 0.000
% 4.69/1.25 # Current number of processed clauses : 16
% 4.69/1.25 # Positive orientable unit clauses : 14
% 4.69/1.25 # Positive unorientable unit clauses: 2
% 4.69/1.25 # Negative unit clauses : 0
% 4.69/1.25 # Non-unit-clauses : 0
% 4.69/1.25 # Current number of unprocessed clauses: 18712
% 4.69/1.25 # ...number of literals in the above : 18712
% 4.69/1.25 # Current number of archived formulas : 0
% 4.69/1.25 # Current number of archived clauses : 102
% 4.69/1.25 # Clause-clause subsumption calls (NU) : 0
% 4.69/1.25 # Rec. Clause-clause subsumption calls : 0
% 4.69/1.25 # Non-unit clause-clause subsumptions : 0
% 4.69/1.25 # Unit Clause-clause subsumption calls : 271
% 4.69/1.25 # Rewrite failures with RHS unbound : 0
% 4.69/1.25 # BW rewrite match attempts : 1329
% 4.69/1.25 # BW rewrite match successes : 275
% 4.69/1.25 # Condensation attempts : 0
% 4.69/1.25 # Condensation successes : 0
% 4.69/1.25 # Termbank termtop insertions : 1554086
% 4.69/1.25 # Search garbage collected termcells : 2
% 4.69/1.25
% 4.69/1.25 # -------------------------------------------------
% 4.69/1.25 # User time : 0.700 s
% 4.69/1.25 # System time : 0.031 s
% 4.69/1.25 # Total time : 0.731 s
% 4.69/1.25 # Maximum resident set size: 1608 pages
% 4.69/1.25
% 4.69/1.25 # -------------------------------------------------
% 4.69/1.25 # User time : 0.720 s
% 4.69/1.25 # System time : 0.054 s
% 4.69/1.25 # Total time : 0.774 s
% 4.69/1.25 # Maximum resident set size: 1688 pages
% 4.69/1.25 % E---3.1 exiting
%------------------------------------------------------------------------------