↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : RNG001-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n003.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:54:52 AM UTC 2026

% Result   : Unsatisfiable 273.06s 273.39s
% Output   : Proof 273.26s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(additive_identity1,axiom,
    sum(additive_identity,X,X),
    file('theBenchmark.p',additive_identity1) ).

cnf(additive_inverse1,axiom,
    sum(additive_inverse(X),X,additive_identity),
    file('theBenchmark.p',additive_inverse1) ).

cnf(associativity_of_addition1,axiom,
    ( sum(X,V,W)
    | ~ sum(U,Z,W)
    | ~ sum(Y,Z,V)
    | ~ sum(X,Y,U) ),
    file('theBenchmark.p',associativity_of_addition1) ).

cnf(associativity_of_addition2,axiom,
    ( sum(U,Z,W)
    | ~ sum(X,V,W)
    | ~ sum(Y,Z,V)
    | ~ sum(X,Y,U) ),
    file('theBenchmark.p',associativity_of_addition2) ).

cnf(closure_of_multiplication,axiom,
    product(X,Y,multiply(X,Y)),
    file('theBenchmark.p',closure_of_multiplication) ).

cnf(distributivity1,axiom,
    ( sum(V1,V2,V4)
    | ~ product(X,V3,V4)
    | ~ sum(Y,Z,V3)
    | ~ product(X,Z,V2)
    | ~ product(X,Y,V1) ),
    file('theBenchmark.p',distributivity1) ).

cnf(distributivity2,axiom,
    ( product(X,V3,V4)
    | ~ sum(V1,V2,V4)
    | ~ sum(Y,Z,V3)
    | ~ product(X,Z,V2)
    | ~ product(X,Y,V1) ),
    file('theBenchmark.p',distributivity2) ).

cnf(prove_a_times_additive_id_is_additive_id,negated_conjecture,
    ~ product(a,additive_identity,additive_identity),
    file('theBenchmark.p',prove_a_times_additive_id_is_additive_id) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG001-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.04  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n003.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 19 20:36:13 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 273.06/273.39  % SZS status Unsatisfiable for theBenchmark
% 273.06/273.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------