%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUM021-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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 08:51:39 AM UTC 2026
% Result : Unsatisfiable 0.14s 5.77s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(adding_zero,axiom,
equalish(add(A,n0),A),
file('NUM001-0.ax',adding_zero) ).
cnf(addition,axiom,
equalish(add(A,successor(B)),successor(add(A,B))),
file('NUM001-0.ax',addition) ).
cnf(times_zero,axiom,
equalish(multiply(A,n0),n0),
file('NUM001-0.ax',times_zero) ).
cnf(times,axiom,
equalish(multiply(A,successor(B)),add(multiply(A,B),A)),
file('NUM001-0.ax',times) ).
cnf(successor_equality1,axiom,
( equalish(A,B)
| ~ equalish(successor(A),successor(B)) ),
file('NUM001-0.ax',successor_equality1) ).
cnf(successor_substitution,axiom,
( equalish(successor(A),successor(B))
| ~ equalish(A,B) ),
file('NUM001-0.ax',successor_substitution) ).
cnf(transitivity_of_less,axiom,
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ),
file('NUM001-1.ax',transitivity_of_less) ).
cnf(smaller_number,axiom,
( less(B,C)
| ~ equalish(add(successor(A),B),C) ),
file('NUM001-1.ax',smaller_number) ).
cnf(less_lemma,axiom,
( equalish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B)
| ~ less(A,B) ),
file('NUM001-1.ax',less_lemma) ).
cnf(divides_only_less_or_equal,axiom,
( equalish(A,B)
| less(A,B)
| ~ divides(A,B) ),
file('NUM001-2.ax',divides_only_less_or_equal) ).
cnf(divides_if_less,axiom,
( divides(A,B)
| ~ less(A,B) ),
file('NUM001-2.ax',divides_if_less) ).
cnf(divides_if_equal,axiom,
( divides(A,B)
| ~ equalish(A,B) ),
file('NUM001-2.ax',divides_if_equal) ).
cnf(reflexivity,axiom,
equalish(X,X),
file('theBenchmark.p',reflexivity) ).
cnf(symmetry,axiom,
( equalish(Y,X)
| ~ equalish(X,Y) ),
file('theBenchmark.p',symmetry) ).
cnf(transitivity,axiom,
( equalish(X,Z)
| ~ equalish(Y,Z)
| ~ equalish(X,Y) ),
file('theBenchmark.p',transitivity) ).
cnf(b_less_than_c,hypothesis,
less(b,c),
file('theBenchmark.p',b_less_than_c) ).
cnf(b_greater_equal_a,hypothesis,
~ less(b,a),
file('theBenchmark.p',b_greater_equal_a) ).
cnf(impossible_c_divides_a,negated_conjecture,
divides(c,a),
file('theBenchmark.p',impossible_c_divides_a) ).
cnf(prove_a_contradiction,negated_conjecture,
~ equalish(successor(A),n0),
file('theBenchmark.p',prove_a_contradiction) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM021-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.58 % Computer : n008.cluster.edu
% 0.09/5.58 % Model : x86_64 x86_64
% 0.09/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.58 % Memory : 8046.5625MB
% 0.09/5.58 % OS : Linux 6.8.0-71-generic
% 0.09/5.58 % CPULimit : 300
% 0.09/5.58 % WCLimit : 300
% 0.09/5.58 % DateTime : Sat Sep 19 17:36:16 UTC 2026
% 0.09/5.58 % CPUTime :
% 0.14/5.77 % SZS status Unsatisfiable for theBenchmark
% 0.14/5.77 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------