↑ Up

SATCoP---0.1.UNS-Prf.s

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

% Computer : n026.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:27 PM UTC 2026

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

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

cnf(g1,plain,
    sPE(or(q,r),or(q,r)),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL226-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % Command  : satcop --statistics %s
% 0.09/0.36  % Computer : n026.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 11:47:25 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 9.97/1.89  % symbols: 10
% 9.97/1.89  % clauses: 17
% 9.97/1.89  % start clauses: 1
% 9.97/1.89  % iterative deepening steps: 3033
% 9.97/1.89  % maximum path limit: 8
% 9.97/1.89  % literal attempts: 725778
% 9.97/1.89  % depth failures: 354590
% 9.97/1.89  % regularity failures: 40565
% 9.97/1.89  % tautology failures: 79521
% 9.97/1.89  % reductions: 0
% 9.97/1.89  % extensions: 724201
% 9.97/1.89  % SAT variables: 179546
% 9.97/1.89  % SAT clauses: 298038
% 9.97/1.89  % WalkSAT solutions: 298037
% 9.97/1.89  % CDCL solutions: 0
% 9.97/1.89  % SZS status Unsatisfiable for theBenchmark
% 9.97/1.89  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------