TSTP Solution File: LCL193-3 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LCL193-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 14:13:32 EDT 2022

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

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

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

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

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

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

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

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

cnf(g7,plain,
    axiom(implies(or(p,r),or(r,p))),
    inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_4)]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL193-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.13  % Command  : satcop --statistics %s
% 0.13/0.33  % Computer : n015.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul  4 03:10:46 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 9.98/1.64  % symbols: 10
% 9.98/1.64  % clauses: 17
% 9.98/1.64  % start clauses: 1
% 9.98/1.64  % iterative deepening steps: 3651
% 9.98/1.64  % maximum path limit: 9
% 9.98/1.64  % literal attempts: 980726
% 9.98/1.64  % depth failures: 473621
% 9.98/1.64  % regularity failures: 57439
% 9.98/1.64  % tautology failures: 114661
% 9.98/1.64  % reductions: 0
% 9.98/1.64  % extensions: 979127
% 9.98/1.64  % SAT variables: 253458
% 9.98/1.64  % SAT clauses: 423030
% 9.98/1.64  % WalkSAT solutions: 423028
% 9.98/1.64  % CDCL solutions: 0
% 9.98/1.64  % SZS status Unsatisfiable for theBenchmark
% 9.98/1.64  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------