%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG130-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:06:30 PM UTC 2026
% Result : Unsatisfiable 140.53s 18.60s
% Output : CNFRefutation 140.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of clauses : 67 ( 67 unt; 0 nHn; 11 RR)
% Number of literals : 67 ( 66 equ; 9 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 14 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 136 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(plus_assoc,axiom,
plus(X1,plus(X2,X3)) = plus(plus(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_assoc) ).
cnf(plus_inv,axiom,
plus(X1,minus(X1)) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_inv) ).
cnf(plus_zero,axiom,
plus(zero,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_zero) ).
cnf(plus_comm,axiom,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_comm) ).
cnf(distrib1,axiom,
times(X1,plus(X2,X3)) = plus(times(X1,X2),times(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distrib1) ).
cnf(goals,negated_conjecture,
times(plus(sq(a),times(n,sq(b))),plus(sq(c),times(n,sq(d)))) != plus(sq(plus(times(a,c),times(minus(n),times(b,d)))),times(n,sq(plus(times(a,d),times(b,c))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(square,axiom,
sq(X1) = times(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',square) ).
cnf(times_com,axiom,
times(X1,X2) = times(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times_com) ).
cnf(times_assoc,axiom,
times(X1,times(X2,X3)) = times(times(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times_assoc) ).
cnf(distrib2,axiom,
times(plus(X1,X2),X3) = plus(times(X1,X3),times(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distrib2) ).
cnf(c_0_10,axiom,
plus(X1,plus(X2,X3)) = plus(plus(X1,X2),X3),
plus_assoc ).
cnf(c_0_11,axiom,
plus(X1,minus(X1)) = zero,
plus_inv ).
cnf(c_0_12,axiom,
plus(zero,X1) = X1,
plus_zero ).
cnf(c_0_13,axiom,
plus(X1,X2) = plus(X2,X1),
plus_comm ).
cnf(c_0_14,plain,
plus(X1,plus(minus(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,plain,
plus(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
plus(X1,plus(X2,minus(X1))) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_17,plain,
minus(minus(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_15]) ).
cnf(c_0_18,axiom,
times(X1,plus(X2,X3)) = plus(times(X1,X2),times(X1,X3)),
distrib1 ).
cnf(c_0_19,plain,
plus(minus(X1),plus(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
plus(X1,plus(X2,minus(plus(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_21,plain,
plus(times(X1,zero),times(X1,X2)) = times(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_22,plain,
plus(minus(X1),plus(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_23,plain,
plus(X1,minus(plus(X1,X2))) = minus(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_19]),c_0_13]) ).
cnf(c_0_24,plain,
times(X1,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_11]),c_0_15]) ).
cnf(c_0_25,plain,
minus(plus(X1,X2)) = plus(minus(X1),minus(X2)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
plus(times(X1,X2),times(X1,minus(X2))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_24]) ).
cnf(c_0_27,plain,
minus(zero) = zero,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_28,negated_conjecture,
times(plus(sq(a),times(n,sq(b))),plus(sq(c),times(n,sq(d)))) != plus(sq(plus(times(a,c),times(minus(n),times(b,d)))),times(n,sq(plus(times(a,d),times(b,c))))),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_29,plain,
plus(minus(times(X1,X2)),minus(times(X1,minus(X2)))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
times(plus(sq(a),times(n,sq(b))),plus(sq(c),times(n,sq(d)))) != plus(sq(plus(times(a,c),times(minus(n),times(b,d)))),times(n,sq(plus(times(a,d),times(b,c))))),
c_0_28 ).
cnf(c_0_31,axiom,
sq(X1) = times(X1,X1),
square ).
cnf(c_0_32,plain,
minus(times(X1,X2)) = times(X1,minus(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_29]),c_0_15]) ).
cnf(c_0_33,axiom,
times(X1,X2) = times(X2,X1),
times_com ).
cnf(c_0_34,negated_conjecture,
times(plus(times(a,a),times(n,times(b,b))),plus(times(c,c),times(n,times(d,d)))) != plus(times(plus(times(a,c),times(minus(n),times(b,d))),plus(times(a,c),times(minus(n),times(b,d)))),times(n,times(plus(times(a,d),times(b,c)),plus(times(a,d),times(b,c))))),
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_30,c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_35,plain,
times(X1,minus(X2)) = times(X2,minus(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
plus(times(n,times(plus(times(a,d),times(b,c)),plus(times(a,d),times(b,c)))),times(plus(times(a,c),times(times(b,d),minus(n))),plus(times(a,c),times(times(b,d),minus(n))))) != times(plus(times(a,a),times(n,times(b,b))),plus(times(c,c),times(n,times(d,d)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_33]),c_0_33]),c_0_13]) ).
cnf(c_0_37,axiom,
times(X1,times(X2,X3)) = times(times(X1,X2),X3),
times_assoc ).
cnf(c_0_38,axiom,
times(plus(X1,X2),X3) = plus(times(X1,X3),times(X2,X3)),
distrib2 ).
cnf(c_0_39,plain,
times(X1,minus(X2)) = times(minus(X1),X2),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_40,plain,
plus(times(X1,X2),times(minus(X2),X1)) = zero,
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
plus(times(n,times(a,times(d,times(a,d)))),plus(times(n,times(b,times(c,times(a,d)))),plus(times(n,times(b,times(c,times(b,c)))),plus(times(n,times(a,times(d,times(b,c)))),plus(times(a,times(c,times(a,c))),plus(times(a,times(c,times(b,times(d,minus(n))))),plus(times(b,times(d,times(a,times(c,minus(n))))),times(b,times(d,times(minus(n),times(b,times(d,minus(n))))))))))))) != plus(times(a,times(a,times(c,c))),plus(times(n,times(b,times(b,times(c,c)))),plus(times(a,times(a,times(n,times(d,d)))),times(n,times(b,times(b,times(n,times(d,d)))))))),
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)],[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)],[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)],[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)],[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_18]),c_0_33]),c_0_18]),c_0_37]),c_0_37]),c_0_33]),c_0_18]),c_0_37]),c_0_37]),c_0_10]),c_0_13]),c_0_10]),c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_37]),c_0_33]),c_0_18]),c_0_37]),c_0_37]),c_0_37]),c_0_37]),c_0_33]),c_0_18]),c_0_37]),c_0_37]),c_0_33]),c_0_37]),c_0_37]),c_0_37]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_18]),c_0_38]),c_0_37]),c_0_37]),c_0_37]),c_0_38]),c_0_37]),c_0_37]),c_0_37]),c_0_10]) ).
cnf(c_0_42,plain,
plus(X1,plus(X2,X3)) = plus(X2,plus(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_10]) ).
cnf(c_0_43,plain,
times(minus(X1),minus(X2)) = times(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_39]),c_0_32]),c_0_17]) ).
cnf(c_0_44,plain,
plus(X1,plus(X2,plus(minus(X1),X3))) = plus(X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_10]) ).
cnf(c_0_45,plain,
plus(times(X1,X2),plus(times(minus(X2),X1),X3)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_40]),c_0_12]) ).
cnf(c_0_46,negated_conjecture,
plus(times(a,times(c,times(a,c))),plus(times(n,times(b,times(c,times(a,d)))),plus(times(n,times(b,times(c,times(b,c)))),plus(times(n,times(a,times(d,times(a,d)))),plus(times(n,times(a,times(d,times(b,c)))),plus(times(a,times(c,times(b,times(d,minus(n))))),plus(times(b,times(d,times(a,times(c,minus(n))))),times(b,times(d,times(minus(n),times(b,times(d,minus(n))))))))))))) != plus(times(a,times(a,times(c,c))),plus(times(n,times(b,times(b,times(c,c)))),plus(times(a,times(a,times(n,times(d,d)))),times(n,times(b,times(b,times(n,times(d,d)))))))),
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_41,c_0_42]),c_0_42]),c_0_42]),c_0_42]),c_0_42]),c_0_42]) ).
cnf(c_0_47,plain,
times(X1,times(X2,X3)) = times(X3,times(X1,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_37]) ).
cnf(c_0_48,plain,
times(minus(X1),times(X2,minus(X3))) = times(X1,times(X2,X3)),
inference(spm,[status(thm)],[c_0_43,c_0_32]) ).
cnf(c_0_49,plain,
times(minus(X1),X2) = times(minus(X2),X1),
inference(spm,[status(thm)],[c_0_33,c_0_39]) ).
cnf(c_0_50,plain,
times(minus(X1),times(minus(X2),X3)) = times(X1,times(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_43]),c_0_37]) ).
cnf(c_0_51,plain,
plus(minus(X1),plus(X2,plus(X1,X3))) = plus(X2,X3),
inference(spm,[status(thm)],[c_0_44,c_0_17]) ).
cnf(c_0_52,plain,
plus(X1,plus(X2,X3)) = plus(X3,plus(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_53,plain,
plus(times(X1,X2),X3) = plus(X3,times(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_16]),c_0_32]),c_0_43]) ).
cnf(c_0_54,plain,
plus(times(X1,X2),times(minus(X1),X2)) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
cnf(c_0_55,negated_conjecture,
plus(times(a,times(a,times(c,c))),plus(times(n,times(b,times(b,times(c,c)))),plus(times(n,times(a,times(b,times(c,d)))),plus(times(n,times(b,times(c,times(a,d)))),plus(times(n,times(a,times(a,times(d,d)))),plus(times(a,times(c,times(b,times(d,minus(n))))),plus(times(b,times(d,times(a,times(c,minus(n))))),times(b,times(d,times(minus(n),times(b,times(d,minus(n))))))))))))) != plus(times(a,times(a,times(c,c))),plus(times(n,times(b,times(b,times(c,c)))),plus(times(a,times(a,times(n,times(d,d)))),times(n,times(b,times(b,times(n,times(d,d)))))))),
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_46,c_0_47]),c_0_47]),c_0_47]),c_0_47]),c_0_42]),c_0_42]),c_0_42]) ).
cnf(c_0_56,plain,
times(X1,times(X2,X3)) = times(X2,times(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_33]),c_0_37]) ).
cnf(c_0_57,plain,
times(minus(X1),times(X2,X3)) = times(X1,times(minus(X3),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_17]) ).
cnf(c_0_58,plain,
times(minus(X1),times(X2,times(minus(X3),X4))) = times(X1,times(X2,times(X3,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_32]),c_0_37]),c_0_37]) ).
cnf(c_0_59,plain,
plus(minus(X1),plus(X2,plus(X3,plus(X4,X1)))) = plus(X2,plus(X3,X4)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_60,plain,
plus(times(minus(X1),X2),X3) = plus(X3,times(X1,minus(X2))),
inference(spm,[status(thm)],[c_0_53,c_0_35]) ).
cnf(c_0_61,plain,
plus(times(X1,X2),plus(times(minus(X1),X2),X3)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_54]),c_0_12]) ).
cnf(c_0_62,negated_conjecture,
plus(times(a,times(a,times(c,c))),plus(times(n,times(b,times(b,times(c,c)))),plus(times(a,times(n,times(b,times(c,d)))),plus(times(a,times(n,times(b,times(c,d)))),plus(times(a,times(a,times(n,times(d,d)))),plus(times(a,times(b,times(c,times(d,minus(n))))),plus(times(a,times(b,times(c,times(d,minus(n))))),times(b,times(b,times(d,times(d,times(minus(n),minus(n))))))))))))) != plus(times(a,times(a,times(c,c))),plus(times(n,times(b,times(b,times(c,c)))),plus(times(a,times(a,times(n,times(d,d)))),times(n,times(n,times(b,times(b,times(d,d)))))))),
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)],[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_55,c_0_33]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]) ).
cnf(c_0_63,plain,
times(minus(X1),times(X2,times(X3,times(X4,X5)))) = times(X1,times(X3,times(X4,times(X5,minus(X2))))),
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_57,c_0_58]),c_0_32]),c_0_32]),c_0_43]),c_0_37]),c_0_37]) ).
cnf(c_0_64,plain,
plus(times(X1,X2),plus(X3,plus(X4,plus(times(minus(X1),X2),X5)))) = plus(X3,plus(X4,X5)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_32]),c_0_17]) ).
cnf(c_0_65,plain,
plus(times(X1,X2),plus(X3,plus(times(minus(X1),X2),X4))) = plus(X3,X4),
inference(spm,[status(thm)],[c_0_42,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_43]),c_0_47]),c_0_33]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_64]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG130-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 04:22:19 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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
% 140.53/18.60 % Version: 3.5.1
% 140.53/18.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 140.53/18.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 140.53/18.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 140.53/18.60 % Starting new_bool_3 with 300s (1) cores
% 140.53/18.60 % Starting new_bool_1 with 300s (1) cores
% 140.53/18.60 % Starting sh5l with 300s (1) cores
% 140.53/18.60 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2235608 completed with status 0
% 140.53/18.60 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 140.53/18.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 140.53/18.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 140.53/18.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 140.53/18.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 140.53/18.60 % No SInE strategy applied
% 140.53/18.60 % Search class: FUUPM-FFSF21-MFFFFFNN
% 140.53/18.60 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 140.53/18.60 % Starting SubtermCWHack with 136s (1) cores
% 140.53/18.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 140.53/18.60 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 140.53/18.60 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 140.53/18.60 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 140.53/18.60 % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 2235619 completed with status 0
% 140.53/18.60 % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 140.53/18.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 140.53/18.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 140.53/18.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 140.53/18.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 140.53/18.60 % No SInE strategy applied
% 140.53/18.60 % Search class: FUUPM-FFSF21-MFFFFFNN
% 140.53/18.60 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 140.53/18.60 % Starting SubtermCWHack with 136s (1) cores
% 140.53/18.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 140.53/18.60 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 140.53/18.60 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 140.53/18.60 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 140.53/18.60 % Preprocessing time : 0.001 s
% 140.53/18.60
% 140.53/18.60 % Proof found!
% 140.53/18.60 % SZS status Unsatisfiable
% 140.53/18.60 % SZS output start CNFRefutation
% See solution above
% 140.53/18.60 % Parsed axioms : 10
% 140.53/18.60 % Removed by relevancy pruning/SinE : 0
% 140.53/18.60 % Initial clauses : 10
% 140.53/18.60 % Removed in clause preprocessing : 1
% 140.53/18.60 % Initial clauses in saturation : 9
% 140.53/18.60 % Processed clauses : 61100
% 140.53/18.60 % ...of these trivial : 32546
% 140.53/18.60 % ...subsumed : 27810
% 140.53/18.60 % ...remaining for further processing : 744
% 140.53/18.60 % Other redundant clauses eliminated : 0
% 140.53/18.60 % Clauses deleted for lack of memory : 0
% 140.53/18.60 % Backward-subsumed : 9
% 140.53/18.60 % Backward-rewritten : 54
% 140.53/18.60 % Generated clauses : 1043504
% 140.53/18.60 % ...of the previous two non-redundant : 914896
% 140.53/18.60 % ...aggressively subsumed : 0
% 140.53/18.60 % Contextual simplify-reflections : 0
% 140.53/18.60 % Paramodulations : 1043504
% 140.53/18.60 % Factorizations : 0
% 140.53/18.60 % NegExts : 0
% 140.53/18.60 % Equation resolutions : 0
% 140.53/18.60 % Disequality decompositions : 0
% 140.53/18.60 % Total rewrite steps : 2541281
% 140.53/18.60 % ...of those cached : 2484148
% 140.53/18.60 % Propositional unsat checks : 0
% 140.53/18.60 % Propositional check models : 0
% 140.53/18.60 % Propositional check unsatisfiable : 0
% 140.53/18.60 % Propositional clauses : 0
% 140.53/18.60 % Propositional clauses after purity: 0
% 140.53/18.60 % Propositional unsat core size : 0
% 140.53/18.60 % Propositional preprocessing time : 0.000
% 140.53/18.60 % Propositional encoding time : 0.000
% 140.53/18.60 % Propositional solver time : 0.000
% 140.53/18.60 % Success case prop preproc time : 0.000
% 140.53/18.60 % Success case prop encoding time : 0.000
% 140.53/18.60 % Success case prop solver time : 0.000
% 140.53/18.60 % Current number of processed clauses : 681
% 140.53/18.60 % Positive orientable unit clauses : 356
% 140.53/18.60 % Positive unorientable unit clauses: 319
% 140.53/18.60 % Negative unit clauses : 6
% 140.53/18.60 % Non-unit-clauses : 0
% 140.53/18.60 % Current number of unprocessed clauses: 850145
% 140.53/18.60 % ...number of literals in the above : 850145
% 140.53/18.60 % Current number of archived formulas : 0
% 140.53/18.60 % Current number of archived clauses : 64
% 140.53/18.60 % Clause-clause subsumption calls (NU) : 0
% 140.53/18.60 % Rec. Clause-clause subsumption calls : 0
% 140.53/18.60 % Non-unit clause-clause subsumptions : 0
% 140.53/18.60 % Unit Clause-clause subsumption calls : 15750
% 140.53/18.60 % Rewrite failures with RHS unbound : 5957
% 140.53/18.60 % BW rewrite match attempts : 55310
% 140.53/18.60 % BW rewrite match successes : 9533
% 140.53/18.60 % Condensation attempts : 0
% 140.53/18.60 % Condensation successes : 0
% 140.53/18.60 % Termbank termtop insertions : 17131617
% 140.53/18.60 % Search garbage collected termcells : 2
% 140.53/18.60
% 140.53/18.60 % -------------------------------------------------
% 140.53/18.60 % User time : 15.657 s
% 140.53/18.60 % System time : 0.701 s
% 140.53/18.60 % Total time : 16.358 s
% 140.53/18.60 % Maximum resident set size: 3384 pages
% 140.53/18.60
% 140.53/18.60 % -------------------------------------------------
% 140.53/18.60 % User time : 83.294 s
% 140.53/18.60 % System time : 3.442 s
% 140.53/18.60 % Total time : 86.736 s
% 140.53/18.60 % Maximum resident set size: 4608 pages
% 140.53/18.60 % E exiting
%------------------------------------------------------------------------------