↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : REL003-1 : TPTP v9.3.1. Released 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 : n002.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:39 AM UTC 2026

% Result   : Unsatisfiable 250.91s 271.22s
% Output   : Proof 254.81s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(maddux1_join_commutativity_1,axiom,
    join(A,B) = join(B,A),
    file('REL001-0.ax',maddux1_join_commutativity_1) ).

cnf(maddux2_join_associativity_2,axiom,
    join(A,join(B,C)) = join(join(A,B),C),
    file('REL001-0.ax',maddux2_join_associativity_2) ).

cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
    A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))),
    file('REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).

cnf(maddux4_definiton_of_meet_4,axiom,
    meet(A,B) = complement(join(complement(A),complement(B))),
    file('REL001-0.ax',maddux4_definiton_of_meet_4) ).

cnf(composition_associativity_5,axiom,
    composition(A,composition(B,C)) = composition(composition(A,B),C),
    file('REL001-0.ax',composition_associativity_5) ).

cnf(composition_identity_6,axiom,
    composition(A,one) = A,
    file('REL001-0.ax',composition_identity_6) ).

cnf(composition_distributivity_7,axiom,
    composition(join(A,B),C) = join(composition(A,C),composition(B,C)),
    file('REL001-0.ax',composition_distributivity_7) ).

cnf(converse_idempotence_8,axiom,
    converse(converse(A)) = A,
    file('REL001-0.ax',converse_idempotence_8) ).

cnf(converse_additivity_9,axiom,
    converse(join(A,B)) = join(converse(A),converse(B)),
    file('REL001-0.ax',converse_additivity_9) ).

cnf(converse_multiplicativity_10,axiom,
    converse(composition(A,B)) = composition(converse(B),converse(A)),
    file('REL001-0.ax',converse_multiplicativity_10) ).

cnf(converse_cancellativity_11,axiom,
    join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B),
    file('REL001-0.ax',converse_cancellativity_11) ).

cnf(def_top_12,axiom,
    top = join(A,complement(A)),
    file('REL001-0.ax',def_top_12) ).

cnf(def_zero_13,axiom,
    zero = meet(A,complement(A)),
    file('REL001-0.ax',def_zero_13) ).

cnf(goals_14,negated_conjecture,
    ( join(converse(sk1),converse(sk2)) = converse(sk2)
    | join(sk1,sk2) = sk2 ),
    file('theBenchmark.p',goals_14) ).

cnf(goals_17,negated_conjecture,
    ( join(converse(sk1),converse(sk2)) != converse(sk2)
    | join(sk1,sk2) != sk2 ),
    file('theBenchmark.p',goals_17) ).

cnf(equality_1,axiom,
    Eq_x_0 = Eq_x_0,
    theory(equality,[reflexivity]) ).

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(equality_3,axiom,
    ( Eq_x_0 = Eq_x_2
    | Eq_x_1 != Eq_x_2
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[transitivity]) ).

cnf(equality_4,axiom,
    ( join(Eq_x_0,Eq_x_1) = join(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_5,axiom,
    ( complement(Eq_x_0) = complement(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_6,axiom,
    ( meet(Eq_x_0,Eq_x_1) = meet(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_7,axiom,
    ( composition(Eq_x_0,Eq_x_1) = composition(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_8,axiom,
    ( converse(Eq_x_0) = converse(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : REL003-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_PEQ_NUE 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.11/20.41  % Computer : n002.cluster.edu
% 0.11/20.41  % Model    : x86_64 x86_64
% 0.11/20.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/20.41  % Memory   : 8046.5625MB
% 0.11/20.41  % OS       : Linux 6.8.0-71-generic
% 0.11/20.41  % CPULimit : 300
% 0.11/20.41  % WCLimit  : 300
% 0.11/20.41  % DateTime : Sat Sep 19 20:10:51 UTC 2026
% 0.11/20.41  % CPUTime  : 
% 250.91/271.22  % SZS status Unsatisfiable for theBenchmark
% 250.91/271.22  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------