TSTP Solution File: GRP071-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP071-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 17:45:12 EDT 2023
% Result : Unsatisfiable 3.01s 0.83s
% Output : CNFRefutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 3
% Syntax : Number of clauses : 75 ( 70 unt; 0 nHn; 7 RR)
% Number of literals : 84 ( 83 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 214 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(X1,divide(X2,divide(X3,X4)))),divide(divide(X4,X3),X1)) = X2,
file('/export/starexec/sandbox/tmp/tmp.TeAd54GqaN/E---3.1_23735.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox/tmp/tmp.TeAd54GqaN/E---3.1_23735.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/tmp/tmp.TeAd54GqaN/E---3.1_23735.p',multiply) ).
cnf(c_0_3,axiom,
divide(inverse(divide(X1,divide(X2,divide(X3,X4)))),divide(divide(X4,X3),X1)) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,divide(X4,X5)),X1)) = inverse(divide(X3,divide(X2,divide(X5,X4)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),X1)),divide(X4,X3)))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
divide(inverse(X1),divide(divide(X2,X3),inverse(divide(divide(X3,X2),divide(X1,divide(X4,X5)))))) = divide(X5,X4),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_7,plain,
inverse(inverse(divide(X1,divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)))))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_8,plain,
divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),divide(X3,divide(X4,X5))))),inverse(X3)) = divide(X4,X5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_6]) ).
cnf(c_0_9,plain,
divide(inverse(divide(X1,divide(X2,divide(divide(divide(X3,X4),X5),inverse(divide(X5,divide(X6,divide(X4,X3)))))))),divide(X6,X1)) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_10,plain,
inverse(divide(divide(inverse(divide(divide(X1,X2),divide(X3,X4))),divide(X2,X1)),divide(X5,divide(X4,X3)))) = inverse(inverse(X5)),
inference(spm,[status(thm)],[c_0_7,c_0_3]) ).
cnf(c_0_11,plain,
divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),divide(X3,X4)))),inverse(X3)) = X4,
inference(spm,[status(thm)],[c_0_8,c_0_3]) ).
cnf(c_0_12,plain,
divide(inverse(divide(X1,divide(X2,X3))),divide(divide(divide(divide(X4,X5),X6),inverse(divide(X6,divide(X3,divide(X5,X4))))),X1)) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_13,plain,
divide(inverse(inverse(X1)),divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_3]) ).
cnf(c_0_14,plain,
divide(divide(divide(X1,X2),X3),inverse(divide(X3,divide(divide(X4,X5),divide(X2,X1))))) = divide(X5,X4),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_15,plain,
divide(inverse(X1),divide(divide(divide(X2,X3),inverse(divide(divide(X3,X2),X4))),inverse(inverse(X1)))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
divide(X1,divide(divide(divide(X2,X3),inverse(divide(divide(X3,X2),X4))),inverse(X1))) = X4,
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_17,plain,
divide(divide(divide(X1,X2),inverse(X3)),inverse(divide(divide(X4,X5),inverse(divide(divide(X5,X4),X3))))) = inverse(divide(X2,X1)),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_18,plain,
divide(X1,divide(inverse(divide(X2,X3)),inverse(X1))) = inverse(divide(divide(divide(X3,X2),inverse(X4)),X4)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
divide(X1,divide(inverse(divide(X2,X3)),inverse(X1))) = divide(X4,divide(inverse(divide(X2,X3)),inverse(X4))),
inference(spm,[status(thm)],[c_0_18,c_0_18]) ).
cnf(c_0_20,plain,
inverse(divide(inverse(X1),divide(divide(X2,X3),divide(inverse(divide(divide(X4,X5),divide(X1,X3))),divide(X5,X4))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_11]),c_0_4]) ).
cnf(c_0_21,plain,
divide(X1,divide(X2,inverse(X1))) = divide(X3,divide(X2,inverse(X3))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,inverse(X4)),X4)),divide(inverse(X1),X3)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_21]),c_0_4]) ).
cnf(c_0_23,plain,
divide(divide(X1,X2),divide(X3,divide(divide(divide(X2,X1),inverse(X4)),X4))) = inverse(X3),
inference(spm,[status(thm)],[c_0_7,c_0_22]) ).
cnf(c_0_24,plain,
inverse(inverse(divide(X1,divide(X2,divide(inverse(X1),divide(X3,X4)))))) = divide(divide(X4,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_9]),c_0_14]) ).
cnf(c_0_25,plain,
inverse(divide(inverse(X1),divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16]),c_0_14]),c_0_4]) ).
cnf(c_0_26,plain,
divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),inverse(X3)))),inverse(inverse(X4))) = inverse(inverse(divide(X3,X4))),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_27,plain,
divide(divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),divide(X3,X4)))),inverse(X5)),X5) = divide(X4,X3),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_28,plain,
divide(inverse(X1),inverse(inverse(divide(X2,X1)))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_16]) ).
cnf(c_0_29,plain,
divide(divide(X1,inverse(X2)),X2) = divide(divide(X1,inverse(X3)),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_27]) ).
cnf(c_0_30,plain,
divide(inverse(X1),inverse(inverse(divide(divide(X2,inverse(X3)),X3)))) = inverse(divide(X2,inverse(X1))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
divide(X1,inverse(inverse(divide(divide(X2,inverse(X3)),X3)))) = inverse(divide(X2,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_7]) ).
cnf(c_0_32,plain,
divide(inverse(X1),inverse(divide(X1,X2))) = divide(divide(inverse(X2),inverse(X3)),X3),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_33,plain,
divide(X1,inverse(divide(X2,divide(inverse(divide(X3,X4)),inverse(X2))))) = inverse(divide(divide(X4,X3),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_34,plain,
divide(inverse(divide(divide(X1,X2),X3)),inverse(inverse(X4))) = inverse(inverse(divide(X3,divide(X4,divide(X2,X1))))),
inference(spm,[status(thm)],[c_0_28,c_0_3]) ).
cnf(c_0_35,plain,
divide(inverse(divide(X1,inverse(X2))),inverse(inverse(divide(X3,divide(X1,inverse(X3)))))) = inverse(X2),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_36,plain,
divide(inverse(a1),inverse(divide(a1,X1))) = divide(inverse(X2),inverse(divide(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_28]),c_0_32]) ).
cnf(c_0_37,plain,
inverse(inverse(divide(divide(X1,X2),divide(divide(X3,X4),divide(X3,X4))))) = inverse(divide(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_33]),c_0_34]) ).
cnf(c_0_38,plain,
divide(inverse(divide(X1,X2)),inverse(inverse(divide(X3,divide(X1,inverse(X3)))))) = X2,
inference(spm,[status(thm)],[c_0_35,c_0_7]) ).
cnf(c_0_39,plain,
divide(inverse(a1),inverse(divide(a1,inverse(inverse(divide(X1,X2)))))) = divide(inverse(inverse(X2)),inverse(inverse(X1))),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_40,plain,
divide(X1,divide(inverse(X2),inverse(X1))) = divide(inverse(divide(X3,X2)),inverse(X3)),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_41,plain,
divide(inverse(inverse(inverse(divide(X1,X2)))),inverse(inverse(inverse(X1)))) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_28,c_0_28]) ).
cnf(c_0_42,plain,
inverse(inverse(divide(divide(X1,X2),divide(X3,X3)))) = inverse(divide(X2,X1)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
divide(a1,divide(inverse(inverse(inverse(divide(X1,X2)))),inverse(a1))) = divide(inverse(inverse(X1)),inverse(inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_39]),c_0_27]),c_0_40]) ).
cnf(c_0_44,plain,
divide(inverse(inverse(inverse(inverse(X1)))),inverse(inverse(inverse(inverse(X2))))) = inverse(inverse(inverse(inverse(divide(X1,X2))))),
inference(spm,[status(thm)],[c_0_28,c_0_41]) ).
cnf(c_0_45,plain,
inverse(divide(divide(X1,X2),divide(X3,X3))) = divide(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_42]),c_0_13]) ).
cnf(c_0_46,plain,
inverse(inverse(inverse(inverse(divide(a1,divide(inverse(X1),inverse(a1))))))) = divide(a1,divide(inverse(inverse(inverse(inverse(inverse(X1))))),inverse(a1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_41]),c_0_44]),c_0_40]) ).
cnf(c_0_47,plain,
inverse(divide(divide(X1,X2),X3)) = divide(X3,divide(X1,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_45]) ).
cnf(c_0_48,plain,
divide(inverse(inverse(inverse(a1))),inverse(inverse(inverse(divide(a1,inverse(inverse(divide(X1,X2)))))))) = inverse(inverse(inverse(inverse(divide(X2,X1))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_39]),c_0_43]),c_0_44]) ).
cnf(c_0_49,plain,
divide(inverse(X1),inverse(divide(X1,X2))) = divide(inverse(X3),inverse(divide(X3,X2))),
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
cnf(c_0_50,plain,
divide(X1,inverse(inverse(divide(inverse(X2),inverse(divide(X2,X3)))))) = inverse(divide(inverse(X3),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_51,plain,
inverse(inverse(inverse(inverse(divide(a1,divide(X1,inverse(a1))))))) = divide(a1,divide(inverse(inverse(inverse(inverse(X1)))),inverse(a1))),
inference(spm,[status(thm)],[c_0_46,c_0_7]) ).
cnf(c_0_52,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_47,c_0_38]) ).
cnf(c_0_53,plain,
divide(inverse(inverse(inverse(a1))),inverse(inverse(inverse(inverse(divide(inverse(X1),a1)))))) = divide(a1,divide(inverse(inverse(inverse(inverse(inverse(X1))))),inverse(a1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_40]),c_0_51]) ).
cnf(c_0_54,plain,
divide(divide(X1,X2),inverse(X2)) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_28]),c_0_52]),c_0_52]) ).
cnf(c_0_55,plain,
divide(inverse(X1),divide(X2,X1)) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_52]),c_0_52]) ).
cnf(c_0_56,plain,
divide(inverse(inverse(inverse(a1))),inverse(inverse(inverse(inverse(divide(X1,a1)))))) = divide(a1,divide(inverse(inverse(inverse(inverse(X1)))),inverse(a1))),
inference(spm,[status(thm)],[c_0_53,c_0_7]) ).
cnf(c_0_57,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
prove_these_axioms ).
cnf(c_0_58,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_59,plain,
inverse(inverse(X1)) = X1,
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_11,c_0_54]),c_0_55]),c_0_52]),c_0_55]),c_0_52]),c_0_54]) ).
cnf(c_0_60,plain,
divide(inverse(inverse(divide(inverse(inverse(inverse(inverse(X1)))),inverse(a1)))),inverse(inverse(a1))) = inverse(inverse(inverse(inverse(divide(inverse(inverse(divide(X1,a1))),inverse(a1)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_56]),c_0_39]),c_0_44]) ).
cnf(c_0_61,negated_conjecture,
( divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2
| divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1))
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ),
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_57,c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_58]) ).
cnf(c_0_62,plain,
divide(X1,divide(X2,inverse(X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_59]),c_0_55]) ).
cnf(c_0_63,plain,
divide(divide(X1,X1),divide(X2,X3)) = divide(X3,X2),
inference(rw,[status(thm)],[c_0_45,c_0_47]) ).
cnf(c_0_64,plain,
divide(divide(X1,inverse(a1)),a1) = X1,
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)],[inference(rw,[status(thm)],[c_0_60,c_0_59]),c_0_59]),c_0_59]),c_0_59]),c_0_59]),c_0_59]),c_0_52]),c_0_52]),c_0_54]),c_0_59]) ).
cnf(c_0_65,negated_conjecture,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3))
| divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1))
| divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2 ),
inference(rw,[status(thm)],[c_0_61,c_0_52]) ).
cnf(c_0_66,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_52]) ).
cnf(c_0_67,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3))
| divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_59])]) ).
cnf(c_0_69,plain,
divide(X1,X1) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_66]),c_0_59]) ).
cnf(c_0_70,plain,
divide(divide(X1,divide(X2,X3)),X4) = divide(X1,divide(X4,divide(X3,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_47]),c_0_52]),c_0_52]),c_0_59]) ).
cnf(c_0_71,plain,
divide(divide(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[c_0_54,c_0_59]) ).
cnf(c_0_72,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_69])]) ).
cnf(c_0_73,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_55]),c_0_71]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP071-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 02:46:54 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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/tmp/tmp.TeAd54GqaN/E---3.1_23735.p
% 3.01/0.83 # Version: 3.1pre001
% 3.01/0.83 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.01/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.01/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.01/0.83 # Starting new_bool_3 with 300s (1) cores
% 3.01/0.83 # Starting new_bool_1 with 300s (1) cores
% 3.01/0.83 # Starting sh5l with 300s (1) cores
% 3.01/0.83 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 23813 completed with status 0
% 3.01/0.83 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.01/0.83 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.01/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.01/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.01/0.83 # No SInE strategy applied
% 3.01/0.83 # Search class: FUHPF-FFSF21-MFFFFFNN
% 3.01/0.83 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.01/0.83 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 3.01/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.01/0.83 # Starting new_bool_3 with 136s (1) cores
% 3.01/0.83 # Starting new_bool_1 with 136s (1) cores
% 3.01/0.83 # Starting sh5l with 136s (1) cores
% 3.01/0.83 # SAT001_MinMin_p005000_rr_RG with pid 23818 completed with status 0
% 3.01/0.83 # Result found by SAT001_MinMin_p005000_rr_RG
% 3.01/0.83 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.01/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.01/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.01/0.83 # No SInE strategy applied
% 3.01/0.83 # Search class: FUHPF-FFSF21-MFFFFFNN
% 3.01/0.83 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.01/0.83 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 3.01/0.83 # Preprocessing time : 0.001 s
% 3.01/0.83 # Presaturation interreduction done
% 3.01/0.83
% 3.01/0.83 # Proof found!
% 3.01/0.83 # SZS status Unsatisfiable
% 3.01/0.83 # SZS output start CNFRefutation
% See solution above
% 3.01/0.83 # Parsed axioms : 3
% 3.01/0.83 # Removed by relevancy pruning/SinE : 0
% 3.01/0.83 # Initial clauses : 3
% 3.01/0.83 # Removed in clause preprocessing : 1
% 3.01/0.83 # Initial clauses in saturation : 2
% 3.01/0.83 # Processed clauses : 308
% 3.01/0.83 # ...of these trivial : 109
% 3.01/0.83 # ...subsumed : 78
% 3.01/0.83 # ...remaining for further processing : 121
% 3.01/0.83 # Other redundant clauses eliminated : 0
% 3.01/0.83 # Clauses deleted for lack of memory : 0
% 3.01/0.83 # Backward-subsumed : 2
% 3.01/0.83 # Backward-rewritten : 106
% 3.01/0.83 # Generated clauses : 23478
% 3.01/0.83 # ...of the previous two non-redundant : 22509
% 3.01/0.83 # ...aggressively subsumed : 0
% 3.01/0.83 # Contextual simplify-reflections : 0
% 3.01/0.83 # Paramodulations : 23478
% 3.01/0.83 # Factorizations : 0
% 3.01/0.83 # NegExts : 0
% 3.01/0.83 # Equation resolutions : 0
% 3.01/0.83 # Total rewrite steps : 7330
% 3.01/0.83 # Propositional unsat checks : 0
% 3.01/0.83 # Propositional check models : 0
% 3.01/0.83 # Propositional check unsatisfiable : 0
% 3.01/0.83 # Propositional clauses : 0
% 3.01/0.83 # Propositional clauses after purity: 0
% 3.01/0.83 # Propositional unsat core size : 0
% 3.01/0.83 # Propositional preprocessing time : 0.000
% 3.01/0.83 # Propositional encoding time : 0.000
% 3.01/0.83 # Propositional solver time : 0.000
% 3.01/0.83 # Success case prop preproc time : 0.000
% 3.01/0.83 # Success case prop encoding time : 0.000
% 3.01/0.83 # Success case prop solver time : 0.000
% 3.01/0.83 # Current number of processed clauses : 11
% 3.01/0.83 # Positive orientable unit clauses : 10
% 3.01/0.83 # Positive unorientable unit clauses: 1
% 3.01/0.83 # Negative unit clauses : 0
% 3.01/0.83 # Non-unit-clauses : 0
% 3.01/0.83 # Current number of unprocessed clauses: 22033
% 3.01/0.83 # ...number of literals in the above : 22033
% 3.01/0.83 # Current number of archived formulas : 0
% 3.01/0.83 # Current number of archived clauses : 111
% 3.01/0.83 # Clause-clause subsumption calls (NU) : 0
% 3.01/0.83 # Rec. Clause-clause subsumption calls : 0
% 3.01/0.83 # Non-unit clause-clause subsumptions : 0
% 3.01/0.83 # Unit Clause-clause subsumption calls : 185
% 3.01/0.83 # Rewrite failures with RHS unbound : 0
% 3.01/0.83 # BW rewrite match attempts : 745
% 3.01/0.83 # BW rewrite match successes : 201
% 3.01/0.83 # Condensation attempts : 0
% 3.01/0.83 # Condensation successes : 0
% 3.01/0.83 # Termbank termtop insertions : 552395
% 3.01/0.83
% 3.01/0.83 # -------------------------------------------------
% 3.01/0.83 # User time : 0.320 s
% 3.01/0.83 # System time : 0.018 s
% 3.01/0.83 # Total time : 0.338 s
% 3.01/0.83 # Maximum resident set size: 1588 pages
% 3.01/0.83
% 3.01/0.83 # -------------------------------------------------
% 3.01/0.83 # User time : 1.611 s
% 3.01/0.83 # System time : 0.040 s
% 3.01/0.83 # Total time : 1.652 s
% 3.01/0.83 # Maximum resident set size: 1668 pages
% 3.01/0.83 % E---3.1 exiting
%------------------------------------------------------------------------------