↑ Up

FindProof---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : COM010-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n010.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 : Fri Sep 25 01:03:28 PM UTC 2026

% Result   : Unsatisfiable 5.04s 1.11s
% Output   : CNFRefutation 5.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (  16 unt;   0 nHn;  14 RR)
%            Number of literals    :   16 (  15 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-4 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t3,axiom,
    c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t4,plain,
    c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2) = X1,
    inference(orient,[status(thm)],[t3]) ).

cnf(t1,axiom,
    c_UNITY_OAllowedActs(v_G,t_a) = c_UNITY_OAllowedActs(v_F,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t9,plain,
    c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
    inference(orient,[status(thm)],[t1]) ).

cnf(t10,plain,
    v_F = c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(v_F,t_a),c_Pair(c_UNITY_OActs(v_F,t_a),c_UNITY_OAllowedActs(v_G,t_a),tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a)))),tc_set(t_a),tc_prod(tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a))))),t_a),
    inference(cp,[status(thm)],[t4,t9]) ).

cnf(t2,axiom,
    c_UNITY_OInit(v_G,t_a) = c_UNITY_OInit(v_F,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t5,plain,
    c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
    inference(orient,[status(thm)],[t2]) ).

cnf(t12,plain,
    v_F = c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(v_G,t_a),c_Pair(c_UNITY_OActs(v_F,t_a),c_UNITY_OAllowedActs(v_G,t_a),tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a)))),tc_set(t_a),tc_prod(tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a))))),t_a),
    inference(step,[status(thm)],[t10,t5]) ).

cnf(t0,axiom,
    c_UNITY_OActs(v_G,t_a) = c_UNITY_OActs(v_F,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t7,plain,
    c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
    inference(orient,[status(thm)],[t0]) ).

cnf(t13,plain,
    v_F = c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(v_G,t_a),c_Pair(c_UNITY_OActs(v_G,t_a),c_UNITY_OAllowedActs(v_G,t_a),tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a)))),tc_set(t_a),tc_prod(tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a))))),t_a),
    inference(step,[status(thm)],[t12,t7]) ).

cnf(t14,plain,
    v_F = v_G,
    inference(step,[status(thm)],[t13,t4]) ).

cnf(t11,plain,
    v_F = v_G,
    inference(orient,[status(thm)],[t14]) ).

cnf(goal_0,negated_conjecture,
    v_G != v_F,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(g0_0,plain,
    v_G != v_G,
    inference(rw,[status(thm)],[goal_0,t11]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COM010-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n010.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Fri Sep 25 07:46:33 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.04/1.11  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.04/1.11  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------