↑ Up

SATCoP---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LCL434-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% 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 : Mon Sep  7 01:03:49 PM UTC 2026

% Result   : Unsatisfiable 163.27s 20.97s
% Output   : Proof 163.27s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0)]) ).

cnf(g1,plain,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1)]) ).

cnf(g2,plain,
    ( ~ c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a))
    | sPE(v_pa,v_p)
    | c_in(v_pa,v_H,tc_PropLog_Opl(t_a)) ),
    inference(ground_cnf,[],[file('Axioms/MSC001-2.ax',cls_Set_OinsertE_0)]) ).

cnf(g3,plain,
    ( ~ c_in(v_pa,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))
    | c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Oweaken__right_0)]) ).

cnf(g4,plain,
    ( ~ c_in(v_pa,v_H,tc_PropLog_Opl(t_a))
    | c_in(v_pa,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ),
    inference(ground_cnf,[],[file('Axioms/LCL005-0.ax',cls_PropLog_Othms_OH_0)]) ).

cnf(g5,plain,
    sPE(tc_PropLog_Opl(t_a),tc_PropLog_Opl(t_a)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    c_in(t_a,c_insert(t_a,c_emptyset,t_a),t_a),
    inference(ground_cnf,[],[file('Axioms/MSC001-0.ax',cls_Set_OsingletonI_0)]) ).

cnf(g7,plain,
    ( ~ c_in(t_a,c_insert(t_a,c_emptyset,t_a),t_a)
    | sPE(t_a,t_a) ),
    inference(ground_cnf,[],[file('Axioms/MSC001-0.ax',cls_Set_OsingletonD__dest_0)]) ).

cnf(g8,plain,
    sPE(c_append(v_pa,c_List_Olist_ONil,t_a),v_pa),
    inference(ground_cnf,[],[file('Axioms/MSC001-2.ax',cls_List_Oappend__self__conv__iff2_0)]) ).

cnf(g9,plain,
    sPE(c_append(c_List_Olist_ONil,v_H,t_a),v_H),
    inference(ground_cnf,[],[file('Axioms/MSC001-2.ax',cls_List_Oappend__self__conv2__iff2_0)]) ).

cnf(g10,plain,
    ( ~ sPE(c_append(v_pa,c_List_Olist_ONil,t_a),v_pa)
    | ~ sPE(v_pa,v_p)
    | sPE(c_append(v_pa,c_List_Olist_ONil,t_a),v_p) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(c_append(c_List_Olist_ONil,v_H,t_a),v_H)
    | ~ sPE(t_a,t_a)
    | sPE(c_PropLog_Othms(c_append(c_List_Olist_ONil,v_H,t_a),t_a),c_PropLog_Othms(v_H,t_a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(c_append(v_pa,c_List_Olist_ONil,t_a),v_p)
    | ~ sPE(c_append(v_pa,c_List_Olist_ONil,t_a),v_pa)
    | ~ sPE(t_a,t_a)
    | sPE(c_PropLog_Opl_Oop_A_N_62(c_append(v_pa,c_List_Olist_ONil,t_a),c_append(v_pa,c_List_Olist_ONil,t_a),t_a),c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ sPE(c_PropLog_Opl_Oop_A_N_62(c_append(v_pa,c_List_Olist_ONil,t_a),c_append(v_pa,c_List_Olist_ONil,t_a),t_a),c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a))
    | ~ sPE(c_PropLog_Othms(c_append(c_List_Olist_ONil,v_H,t_a),t_a),c_PropLog_Othms(v_H,t_a))
    | ~ sPE(tc_PropLog_Opl(t_a),tc_PropLog_Opl(t_a))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_append(v_pa,c_List_Olist_ONil,t_a),c_append(v_pa,c_List_Olist_ONil,t_a),t_a),c_PropLog_Othms(c_append(c_List_Olist_ONil,v_H,t_a),t_a),tc_PropLog_Opl(t_a))
    | c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_append(v_pa,c_List_Olist_ONil,t_a),c_append(v_pa,c_List_Olist_ONil,t_a),t_a),c_PropLog_Othms(c_append(c_List_Olist_ONil,v_H,t_a),t_a),tc_PropLog_Opl(t_a)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms__I_0)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL434-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.09/0.36  % Computer : n004.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep  5 18:35:44 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 163.27/20.97  % symbols: 212
% 163.27/20.97  % clauses: 1566
% 163.27/20.97  % start clauses: 2
% 163.27/20.97  % iterative deepening steps: 3006
% 163.27/20.97  % maximum path limit: 3
% 163.27/20.97  % literal attempts: 10179817
% 163.27/20.97  % depth failures: 6797993
% 163.27/20.97  % regularity failures: 63079
% 163.27/20.97  % tautology failures: 41474
% 163.27/20.97  % reductions: 3155704
% 163.27/20.97  % extensions: 7022421
% 163.27/20.97  % SAT variables: 2970534
% 163.27/20.97  % SAT clauses: 2761304
% 163.27/20.97  % WalkSAT solutions: 2761249
% 163.27/20.97  % CDCL solutions: 49
% 163.27/20.97  % SZS status Unsatisfiable for theBenchmark
% 163.27/20.97  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------