↑ Up

SATCoP---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LCL174-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n019.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:17 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ theorem(implies(implies(p,q),implies(implies(q,r),implies(p,r)))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).

cnf(g1,plain,
    sPE(implies(p,q),implies(p,q)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    sPE(implies(p,q),or(not(p),q)),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).

cnf(g3,plain,
    sPE(implies(q,r),implies(q,r)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    sPE(not(implies(q,r)),not(implies(q,r))),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    sPE(implies(p,r),or(not(p),r)),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).

cnf(g6,plain,
    ( ~ sPE(implies(q,r),implies(q,r))
    | ~ sPE(implies(p,r),or(not(p),r))
    | sPE(implies(implies(q,r),implies(p,r)),implies(implies(q,r),or(not(p),r))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    sPE(implies(implies(p,q),implies(implies(q,r),or(not(p),r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r)))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).

cnf(g8,plain,
    sPE(implies(implies(q,r),or(not(p),r)),or(not(implies(q,r)),or(not(p),r))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).

cnf(g9,plain,
    ( ~ sPE(implies(p,q),or(not(p),q))
    | sPE(not(implies(p,q)),not(or(not(p),q))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(implies(p,q),implies(p,q))
    | ~ sPE(implies(implies(q,r),implies(p,r)),implies(implies(q,r),or(not(p),r)))
    | sPE(implies(implies(p,q),implies(implies(q,r),implies(p,r))),implies(implies(p,q),implies(implies(q,r),or(not(p),r)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(or(not(implies(p,q)),implies(implies(q,r),or(not(p),r))),implies(implies(p,q),implies(implies(q,r),implies(p,r))))
    | ~ theorem(or(not(implies(p,q)),implies(implies(q,r),or(not(p),r))))
    | theorem(implies(implies(p,q),implies(implies(q,r),implies(p,r)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    ( ~ sPE(implies(implies(p,q),implies(implies(q,r),implies(p,r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r))))
    | sPE(or(not(implies(p,q)),implies(implies(q,r),or(not(p),r))),implies(implies(p,q),implies(implies(q,r),implies(p,r)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ sPE(implies(implies(p,q),implies(implies(q,r),implies(p,r))),implies(implies(p,q),implies(implies(q,r),or(not(p),r))))
    | ~ sPE(implies(implies(p,q),implies(implies(q,r),or(not(p),r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r))))
    | sPE(implies(implies(p,q),implies(implies(q,r),implies(p,r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    axiom(implies(or(not(implies(q,r)),or(not(or(not(p),q)),or(not(p),r))),or(not(or(not(p),q)),or(not(implies(q,r)),or(not(p),r))))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_5)]) ).

cnf(g15,plain,
    ( ~ sPE(not(implies(p,q)),not(or(not(p),q)))
    | ~ sPE(implies(implies(q,r),or(not(p),r)),or(not(implies(q,r)),or(not(p),r)))
    | sPE(or(not(implies(p,q)),implies(implies(q,r),or(not(p),r))),or(not(or(not(p),q)),or(not(implies(q,r)),or(not(p),r)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ theorem(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))))
    | ~ theorem(implies(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r)))))
    | theorem(or(not(implies(p,q)),implies(implies(q,r),or(not(p),r)))) ),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).

cnf(g17,plain,
    ( ~ axiom(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))))
    | theorem(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r)))) ),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).

cnf(g18,plain,
    ( ~ sPE(implies(implies(q,r),implies(or(not(p),q),or(not(p),r))),or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))))
    | ~ axiom(implies(implies(q,r),implies(or(not(p),q),or(not(p),r))))
    | axiom(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g19,plain,
    axiom(implies(implies(q,r),implies(or(not(p),q),or(not(p),r)))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).

cnf(g20,plain,
    sPE(implies(implies(q,r),implies(or(not(p),q),or(not(p),r))),or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r)))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).

cnf(g21,plain,
    ( ~ axiom(implies(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r)))))
    | theorem(implies(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r))))) ),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).

cnf(g22,plain,
    ( ~ sPE(implies(or(not(implies(q,r)),or(not(or(not(p),q)),or(not(p),r))),or(not(or(not(p),q)),or(not(implies(q,r)),or(not(p),r)))),implies(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r)))))
    | ~ axiom(implies(or(not(implies(q,r)),or(not(or(not(p),q)),or(not(p),r))),or(not(or(not(p),q)),or(not(implies(q,r)),or(not(p),r)))))
    | axiom(implies(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g23,plain,
    ( ~ sPE(implies(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r)))),implies(or(not(implies(q,r)),or(not(or(not(p),q)),or(not(p),r))),or(not(or(not(p),q)),or(not(implies(q,r)),or(not(p),r)))))
    | sPE(implies(or(not(implies(q,r)),or(not(or(not(p),q)),or(not(p),r))),or(not(or(not(p),q)),or(not(implies(q,r)),or(not(p),r)))),implies(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g24,plain,
    ( ~ sPE(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))),or(not(implies(q,r)),or(not(or(not(p),q)),or(not(p),r))))
    | ~ sPE(or(not(implies(p,q)),implies(implies(q,r),or(not(p),r))),or(not(or(not(p),q)),or(not(implies(q,r)),or(not(p),r))))
    | sPE(implies(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))),or(not(implies(p,q)),implies(implies(q,r),or(not(p),r)))),implies(or(not(implies(q,r)),or(not(or(not(p),q)),or(not(p),r))),or(not(or(not(p),q)),or(not(implies(q,r)),or(not(p),r))))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g25,plain,
    ( ~ sPE(not(implies(q,r)),not(implies(q,r)))
    | ~ sPE(implies(or(not(p),q),or(not(p),r)),or(not(or(not(p),q)),or(not(p),r)))
    | sPE(or(not(implies(q,r)),implies(or(not(p),q),or(not(p),r))),or(not(implies(q,r)),or(not(or(not(p),q)),or(not(p),r)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g26,plain,
    sPE(implies(or(not(p),q),or(not(p),r)),or(not(or(not(p),q)),or(not(p),r))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL174-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.11/0.37  % Computer : n019.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sat Sep  5 11:34:08 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 39.83/5.46  % symbols: 10
% 39.83/5.46  % clauses: 17
% 39.83/5.46  % start clauses: 1
% 39.83/5.46  % iterative deepening steps: 4929
% 39.83/5.46  % maximum path limit: 11
% 39.83/5.46  % literal attempts: 1619663
% 39.83/5.46  % depth failures: 757498
% 39.83/5.46  % regularity failures: 105272
% 39.83/5.46  % tautology failures: 202829
% 39.83/5.46  % reductions: 0
% 39.83/5.46  % extensions: 1618089
% 39.83/5.46  % SAT variables: 474056
% 39.83/5.46  % SAT clauses: 799606
% 39.83/5.46  % WalkSAT solutions: 799605
% 39.83/5.46  % CDCL solutions: 0
% 39.83/5.46  % SZS status Unsatisfiable for theBenchmark
% 39.83/5.46  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------