↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SYN549+1 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n018.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 : Sun Sep 27 09:29:03 AM UTC 2026

% Result   : Theorem 11.86s 1.98s
% Output   : CNFRefutation 11.86s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN549+1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.38  % Computer : n018.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sat Sep 26 18:15:07 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.86/1.98  % SZS status Theorem for theBenchmark.p
% 11.86/1.98  % SZS output start CNFRefutation for theBenchmark.p
% 11.86/1.98  fof(reflexivity_of_reachable, axiom, ! [X0] : reachable(X0,X0)).
% 11.86/1.98  fof(transitivity_of_reachable, axiom, ! [X0] : ! [X1] : ! [X2] : (((reachable(X0,X1) & reachable(X1,X2)) => reachable(X0,X2)))).
% 11.86/1.98  fof(prove_this, conjecture, ? [X0] : ((reachable('initial$uworld',X0) & ! [X1] : ((reachable(X0,X1) => (? [X2] : ((reachable(X1,X2) & (p(X2) | ? [X3] : ((reachable(X2,X3) & q(X3)))))) <=> (? [X4] : ((reachable(X1,X4) & p(X4))) | ? [X4] : ((reachable(X1,X4) & q(X4)))))))))).
% 11.86/1.98  fof(negated_conjecture, negated_conjecture, ~? [X0] : ((reachable('initial$uworld',X0) & ! [X1] : ((reachable(X0,X1) => (? [X2] : ((reachable(X1,X2) & (p(X2) | ? [X3] : ((reachable(X2,X3) & q(X3)))))) <=> (? [X4] : ((reachable(X1,X4) & p(X4))) | ? [X4] : ((reachable(X1,X4) & q(X4))))))))), inference(negate_conjecture, [status(cth)], [prove_this])).
% 11.86/1.98  cnf(c0, plain, reachable(X0,X0), inference(clausification, [status(esa)], [reflexivity_of_reachable])).
% 11.86/1.98  cnf(c1, plain, ~reachable(X0,X1) | ~reachable(X1,X2) | reachable(X0,X2), inference(clausification, [status(esa)], [transitivity_of_reachable])).
% 11.86/1.98  cnf(c4, plain, ~reachable('initial$uworld',X0) | X1(sK7(X0)) | X2(sK7(X0)), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c5, plain, ~reachable('initial$uworld',X0) | ~X1(sK7(X0)) | ~X2(sK7(X0)), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c7, plain, ~X0(X1) | reachable(X1,sK8(X1)) | reachable(X1,sK9(X1)), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c8, plain, ~X0(X1) | reachable(X1,sK8(X1)) | q(sK9(X1)), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c9, plain, ~X0(X1) | p(sK8(X1)) | reachable(X1,sK9(X1)), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c10, plain, ~X0(X1) | p(sK8(X1)) | q(sK9(X1)), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c11, plain, X0(X1) | ~reachable(X1,X2) | ~p(X2), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c12, plain, X0(X1) | ~reachable(X1,X2) | ~q(X2), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c13, plain, ~X0(X1) | reachable(X1,sK12(X1)), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c14, plain, ~X0(X1) | p(sK12(X1)) | reachable(sK12(X1),sK13(X1)), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c15, plain, ~X0(X1) | p(sK12(X1)) | q(sK13(X1)), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c16, plain, X0(X1) | ~reachable(X1,X2) | ~p(X2), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(c17, plain, X0(X1) | ~reachable(X1,X2) | ~reachable(X2,X3) | ~q(X3), inference(clausification, [status(esa)], [negated_conjecture])).
% 11.86/1.98  cnf(d0, plain, 'Ts5'(sK7('initial$uworld')) | 'Ts4'(sK7('initial$uworld')), inference(resolution, [status(thm)], [c4,c0])).
% 11.86/1.98  cnf(d1, plain, 'Ts4'(X0) | ~p(sK12(X0)) | ~'Ts5'(X0), inference(resolution, [status(thm)], [c11,c13])).
% 11.86/1.98  cnf(d2, plain, ~'Ts5'(X0) | p(sK12(X0)) | reachable(X1,sK13(X0)) | ~reachable(X1,sK12(X0)), inference(resolution, [status(thm)], [c14,c1])).
% 11.86/1.98  cnf(d3, plain, reachable(X0,sK13(X0)) | ~'Ts5'(X0) | p(sK12(X0)) | ~'Ts5'(X0), inference(resolution, [status(thm)], [d2,c13])).
% 11.86/1.98  cnf(d4, plain, ~'Ts5'(X0) | p(sK12(X0)) | 'Ts4'(X0) | ~q(sK13(X0)), inference(resolution, [status(thm)], [d3,c12])).
% 11.86/1.98  cnf(d5, plain, ~'Ts5'(X0) | 'Ts4'(X0) | p(sK12(X0)) | ~'Ts5'(X0) | p(sK12(X0)), inference(resolution, [status(thm)], [d4,c15])).
% 11.86/1.98  cnf(d6, plain, ~'Ts5'(X0) | 'Ts4'(X0) | ~'Ts5'(X0) | 'Ts4'(X0), inference(resolution, [status(thm)], [d5,d1])).
% 11.86/1.98  cnf(d7, plain, 'Ts4'(sK7('initial$uworld')) | 'Ts4'(sK7('initial$uworld')), inference(resolution, [status(thm)], [d6,d0])).
% 11.86/1.98  cnf(d8, plain, ~reachable('initial$uworld','initial$uworld') | ~'Ts5'(sK7('initial$uworld')), inference(resolution, [status(thm)], [d7,c5])).
% 11.86/1.98  cnf(d9, plain, ~'Ts5'(sK7('initial$uworld')), inference(resolution, [status(thm)], [c0,d8])).
% 11.86/1.98  cnf(d10, plain, 'Ts5'(X0) | ~p(sK8(X0)) | ~'Ts4'(X0) | q(sK9(X0)), inference(resolution, [status(thm)], [c16,c8])).
% 11.86/1.98  cnf(d11, plain, ~reachable(X0,X1) | 'Ts5'(X0) | ~q(X1), inference(resolution, [status(thm)], [c17,c0])).
% 11.86/1.98  cnf(d12, plain, 'Ts5'(X0) | ~q(sK9(X0)) | ~'Ts4'(X0) | p(sK8(X0)), inference(resolution, [status(thm)], [d11,c9])).
% 11.86/1.98  cnf(d13, plain, 'Ts5'(X0) | ~'Ts4'(X0) | p(sK8(X0)) | ~'Ts4'(X0) | p(sK8(X0)), inference(resolution, [status(thm)], [d12,c10])).
% 11.86/1.98  cnf(d14, plain, 'Ts5'(X0) | ~'Ts4'(X0) | 'Ts5'(X0) | ~'Ts4'(X0) | q(sK9(X0)), inference(resolution, [status(thm)], [d13,d10])).
% 11.86/1.98  cnf(d15, plain, 'Ts5'(X0) | ~p(sK8(X0)) | reachable(X0,sK9(X0)) | ~'Ts4'(X0), inference(resolution, [status(thm)], [c16,c7])).
% 11.86/1.98  cnf(d16, plain, 'Ts5'(X0) | ~'Ts4'(X0) | ~p(sK8(X0)) | 'Ts5'(X0) | ~q(sK9(X0)), inference(resolution, [status(thm)], [d15,d11])).
% 11.86/1.98  cnf(d17, plain, 'Ts5'(X0) | ~'Ts4'(X0) | ~q(sK9(X0)) | 'Ts5'(X0) | ~'Ts4'(X0), inference(resolution, [status(thm)], [d16,d13])).
% 11.86/1.98  cnf(d18, plain, 'Ts5'(X0) | ~'Ts4'(X0) | 'Ts5'(X0) | ~'Ts4'(X0), inference(resolution, [status(thm)], [d17,d14])).
% 11.86/1.98  cnf(d19, plain, 'Ts5'(sK7('initial$uworld')), inference(resolution, [status(thm)], [d7,d18])).
% 11.86/1.98  cnf(d20, plain, $false, inference(resolution, [status(thm)], [d19,d9])).
% 11.86/1.98  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------