↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n002.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 08:41:28 AM UTC 2026

% Result   : Theorem 20.04s 3.04s
% Output   : CNFRefutation 20.04s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEU257+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  % Computer : n002.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Sat Sep 26 09:02:20 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.04/3.04  % SZS status Theorem for theBenchmark.p
% 20.04/3.04  % SZS output start CNFRefutation for theBenchmark.p
% 20.04/3.04  fof(d4_wellord1, axiom, ! [X0] : ((relation(X0) => ('well$uordering'(X0) <=> (reflexive(X0) & (transitive(X0) & (antisymmetric(X0) & (connected(X0) & 'well$ufounded$urelation'(X0))))))))).
% 20.04/3.04  fof(dt_k2_wellord1, axiom, ! [X0] : ! [X1] : ((relation(X0) => relation('relation$urestriction'(X0,X1))))).
% 20.04/3.04  fof(t22_wellord1, axiom, ! [X0] : ! [X1] : ((relation(X1) => (reflexive(X1) => reflexive('relation$urestriction'(X1,X0)))))).
% 20.04/3.04  fof(t23_wellord1, axiom, ! [X0] : ! [X1] : ((relation(X1) => (connected(X1) => connected('relation$urestriction'(X1,X0)))))).
% 20.04/3.04  fof(t24_wellord1, axiom, ! [X0] : ! [X1] : ((relation(X1) => (transitive(X1) => transitive('relation$urestriction'(X1,X0)))))).
% 20.04/3.04  fof(t25_wellord1, axiom, ! [X0] : ! [X1] : ((relation(X1) => (antisymmetric(X1) => antisymmetric('relation$urestriction'(X1,X0)))))).
% 20.04/3.04  fof(t31_wellord1, axiom, ! [X0] : ! [X1] : ((relation(X1) => ('well$ufounded$urelation'(X1) => 'well$ufounded$urelation'('relation$urestriction'(X1,X0)))))).
% 20.04/3.04  fof(t32_wellord1, conjecture, ! [X0] : ! [X1] : ((relation(X1) => ('well$uordering'(X1) => 'well$uordering'('relation$urestriction'(X1,X0)))))).
% 20.04/3.04  fof(negated_conjecture, negated_conjecture, ~! [X0] : ! [X1] : ((relation(X1) => ('well$uordering'(X1) => 'well$uordering'('relation$urestriction'(X1,X0))))), inference(negate_conjecture, [status(cth)], [t32_wellord1])).
% 20.04/3.04  cnf(c1, plain, ~relation(X0) | ~'well$uordering'(X0) | X1(X0), inference(clausification, [status(esa)], [d4_wellord1])).
% 20.04/3.04  cnf(c2, plain, ~relation(X0) | 'well$uordering'(X0) | ~X1(X0), inference(clausification, [status(esa)], [d4_wellord1])).
% 20.04/3.04  cnf(c3, plain, ~X0(X1) | reflexive(X1), inference(clausification, [status(esa)], [d4_wellord1])).
% 20.04/3.04  cnf(c4, plain, ~X0(X1) | transitive(X1), inference(clausification, [status(esa)], [d4_wellord1])).
% 20.04/3.04  cnf(c5, plain, ~X0(X1) | antisymmetric(X1), inference(clausification, [status(esa)], [d4_wellord1])).
% 20.04/3.04  cnf(c6, plain, ~X0(X1) | connected(X1), inference(clausification, [status(esa)], [d4_wellord1])).
% 20.04/3.04  cnf(c7, plain, ~X0(X1) | 'well$ufounded$urelation'(X1), inference(clausification, [status(esa)], [d4_wellord1])).
% 20.04/3.04  cnf(c8, plain, ~'well$ufounded$urelation'(X0) | X1(X0) | ~connected(X0) | ~antisymmetric(X0) | ~transitive(X0) | ~reflexive(X0), inference(clausification, [status(esa)], [d4_wellord1])).
% 20.04/3.04  cnf(c10, plain, ~relation(X0) | relation('relation$urestriction'(X0,X1)), inference(clausification, [status(esa)], [dt_k2_wellord1])).
% 20.04/3.04  cnf(c12, plain, ~relation(X0) | ~reflexive(X0) | reflexive('relation$urestriction'(X0,X1)), inference(clausification, [status(esa)], [t22_wellord1])).
% 20.04/3.04  cnf(c13, plain, ~relation(X0) | ~connected(X0) | connected('relation$urestriction'(X0,X1)), inference(clausification, [status(esa)], [t23_wellord1])).
% 20.04/3.04  cnf(c14, plain, ~relation(X0) | ~transitive(X0) | transitive('relation$urestriction'(X0,X1)), inference(clausification, [status(esa)], [t24_wellord1])).
% 20.04/3.04  cnf(c15, plain, ~relation(X0) | ~antisymmetric(X0) | antisymmetric('relation$urestriction'(X0,X1)), inference(clausification, [status(esa)], [t25_wellord1])).
% 20.04/3.04  cnf(c16, plain, ~relation(X0) | ~'well$ufounded$urelation'(X0) | 'well$ufounded$urelation'('relation$urestriction'(X0,X1)), inference(clausification, [status(esa)], [t31_wellord1])).
% 20.04/3.04  cnf(c17, plain, relation(sK21), inference(clausification, [status(esa)], [negated_conjecture])).
% 20.04/3.04  cnf(c18, plain, 'well$uordering'(sK21), inference(clausification, [status(esa)], [negated_conjecture])).
% 20.04/3.04  cnf(c19, plain, ~'well$uordering'('relation$urestriction'(sK21,sK20)), inference(clausification, [status(esa)], [negated_conjecture])).
% 20.04/3.04  cnf(d0, plain, ~relation(X0) | ~'well$ufounded$urelation'(X0) | 'Ts2'('relation$urestriction'(X0,X1)) | ~reflexive('relation$urestriction'(X0,X1)) | ~transitive('relation$urestriction'(X0,X1)) | ~antisymmetric('relation$urestriction'(X0,X1)) | ~connected('relation$urestriction'(X0,X1)), inference(resolution, [status(thm)], [c16,c8])).
% 20.04/3.04  cnf(d1, plain, ~relation(X0) | 'Ts2'('relation$urestriction'(X0,X1)) | ~reflexive('relation$urestriction'(X0,X1)) | ~transitive('relation$urestriction'(X0,X1)) | ~antisymmetric('relation$urestriction'(X0,X1)) | ~'well$ufounded$urelation'(X0) | ~relation(X0) | ~connected(X0), inference(resolution, [status(thm)], [d0,c13])).
% 20.04/3.04  cnf(d2, plain, ~relation(X0) | 'Ts2'('relation$urestriction'(X0,X1)) | ~reflexive('relation$urestriction'(X0,X1)) | ~transitive('relation$urestriction'(X0,X1)) | ~connected(X0) | ~'well$ufounded$urelation'(X0) | ~relation(X0) | ~antisymmetric(X0), inference(resolution, [status(thm)], [d1,c15])).
% 20.04/3.04  cnf(d3, plain, ~relation(X0) | 'Ts2'('relation$urestriction'(X0,X1)) | ~reflexive('relation$urestriction'(X0,X1)) | ~antisymmetric(X0) | ~connected(X0) | ~'well$ufounded$urelation'(X0) | ~relation(X0) | ~transitive(X0), inference(resolution, [status(thm)], [d2,c14])).
% 20.04/3.04  cnf(d4, plain, ~relation(X0) | 'Ts2'('relation$urestriction'(X0,X1)) | ~transitive(X0) | ~antisymmetric(X0) | ~connected(X0) | ~'well$ufounded$urelation'(X0) | ~relation(X0) | ~reflexive(X0), inference(resolution, [status(thm)], [d3,c12])).
% 20.04/3.04  cnf(d5, plain, ~relation(X0) | ~reflexive(X0) | ~transitive(X0) | ~antisymmetric(X0) | ~connected(X0) | ~'well$ufounded$urelation'(X0) | 'well$uordering'('relation$urestriction'(X0,X1)) | ~relation('relation$urestriction'(X0,X1)), inference(resolution, [status(thm)], [d4,c2])).
% 20.04/3.04  cnf(d6, plain, 'well$uordering'('relation$urestriction'(X0,X1)) | ~relation(X0) | ~reflexive(X0) | ~transitive(X0) | ~antisymmetric(X0) | ~connected(X0) | ~'well$ufounded$urelation'(X0) | ~relation(X0), inference(resolution, [status(thm)], [d5,c10])).
% 20.04/3.04  cnf(d7, plain, ~relation(sK21) | ~reflexive(sK21) | ~transitive(sK21) | ~antisymmetric(sK21) | ~connected(sK21) | ~'well$ufounded$urelation'(sK21), inference(resolution, [status(thm)], [d6,c19])).
% 20.04/3.04  cnf(d8, plain, ~reflexive(sK21) | ~transitive(sK21) | ~antisymmetric(sK21) | ~connected(sK21) | ~'well$ufounded$urelation'(sK21), inference(resolution, [status(thm)], [c17,d7])).
% 20.04/3.04  cnf(d9, plain, ~'well$uordering'(sK21) | 'Ts2'(sK21), inference(resolution, [status(thm)], [c1,c17])).
% 20.04/3.04  cnf(d10, plain, 'Ts2'(sK21), inference(resolution, [status(thm)], [c18,d9])).
% 20.04/3.04  cnf(d11, plain, reflexive(sK21), inference(resolution, [status(thm)], [c3,d10])).
% 20.04/3.04  cnf(d12, plain, ~transitive(sK21) | ~antisymmetric(sK21) | ~connected(sK21) | ~'well$ufounded$urelation'(sK21), inference(resolution, [status(thm)], [d11,d8])).
% 20.04/3.04  cnf(d13, plain, transitive(sK21), inference(resolution, [status(thm)], [c4,d10])).
% 20.04/3.04  cnf(d14, plain, ~antisymmetric(sK21) | ~connected(sK21) | ~'well$ufounded$urelation'(sK21), inference(resolution, [status(thm)], [d13,d12])).
% 20.04/3.04  cnf(d15, plain, antisymmetric(sK21), inference(resolution, [status(thm)], [c5,d10])).
% 20.04/3.04  cnf(d16, plain, ~connected(sK21) | ~'well$ufounded$urelation'(sK21), inference(resolution, [status(thm)], [d15,d14])).
% 20.04/3.04  cnf(d17, plain, connected(sK21), inference(resolution, [status(thm)], [c6,d10])).
% 20.04/3.04  cnf(d18, plain, ~'well$ufounded$urelation'(sK21), inference(resolution, [status(thm)], [d17,d16])).
% 20.04/3.04  cnf(d19, plain, 'well$ufounded$urelation'(sK21), inference(resolution, [status(thm)], [c7,d10])).
% 20.04/3.04  cnf(d20, plain, $false, inference(resolution, [status(thm)], [d19,d18])).
% 20.04/3.04  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------