↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n008.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:11:28 AM UTC 2026

% Result   : Theorem 41.00s 15.75s
% Output   : CNFRefutation 41.00s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW101+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/10.38  % Computer : n008.cluster.edu
% 0.11/10.38  % Model    : x86_64 x86_64
% 0.11/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38  % Memory   : 8046.5625MB
% 0.11/10.38  % OS       : Linux 6.8.0-71-generic
% 0.11/10.38  % CPULimit : 300
% 0.11/10.38  % WCLimit  : 300
% 0.11/10.38  % DateTime : Sat Sep 26 15:25:07 UTC 2026
% 0.11/10.38  % CPUTime  : 
% 0.11/10.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 41.00/15.75  % SZS status Theorem for theBenchmark.p
% 41.00/15.75  % SZS output start CNFRefutation for theBenchmark.p
% 41.00/15.75  fof(def_bool, axiom, ! [X0] : ((bool(X0) <=> (X0 = false | X0 = true)))).
% 41.00/15.75  fof(false_true_err_in_d, axiom, (d(true) & (d(false) & d(err)))).
% 41.00/15.75  fof(def_forallprefers, axiom, ! [X0] : ! [X1] : ((forallprefers(X0,X1) <=> ((~d(X0) & d(X1)) | ((d(X0) & (d(X1) & (~bool(X0) & bool(X1)))) | (X0 = false & X1 = true)))))).
% 41.00/15.75  fof(def_phi, axiom, ! [X0] : (((d(X0) & phi(X0) = X0) | (~d(X0) & phi(X0) = err)))).
% 41.00/15.75  fof(prop_true, axiom, ! [X0] : ((prop(X0) = true <=> bool(X0)))).
% 41.00/15.75  fof(prop_false, axiom, ! [X0] : ((prop(X0) = false <=> ~bool(X0)))).
% 41.00/15.75  fof(lazy_impl_axiom2, axiom, ! [X0] : 'lazy$uimpl'(false,X0) = true).
% 41.00/15.75  fof(lazy_impl_axiom3, axiom, ! [X0] : 'lazy$uimpl'(true,X0) = phi(X0)).
% 41.00/15.75  fof(def_false1, axiom, false1 = false).
% 41.00/15.75  fof(def_f7, axiom, ! [X0] : f7(X0) = 'lazy$uimpl'(prop(X0),X0)).
% 41.00/15.75  fof(def_false2, axiom, ? [X0] : ((false2 = phi(f7(X0)) & ~? [X1] : forallprefers(f7(X1),f7(X0))))).
% 41.00/15.75  fof(false1_false2, conjecture, false1 = false2).
% 41.00/15.75  fof(negated_conjecture, negated_conjecture, false1 != false2, inference(negate_conjecture, [status(cth)], [false1_false2])).
% 41.00/15.75  cnf(c0, plain, ~bool(X0) | X0 = false | X0 = true, inference(clausification, [status(esa)], [def_bool])).
% 41.00/15.75  cnf(c1, plain, bool(X0) | X0 != false, inference(clausification, [status(esa)], [def_bool])).
% 41.00/15.75  cnf(c6, plain, d(true), inference(clausification, [status(esa)], [false_true_err_in_d])).
% 41.00/15.75  cnf(c7, plain, d(false), inference(clausification, [status(esa)], [false_true_err_in_d])).
% 41.00/15.75  cnf(c10, plain, forallprefers(X0,X1) | ~X2(X0,X1), inference(clausification, [status(esa)], [def_forallprefers])).
% 41.00/15.75  cnf(c20, plain, X0(X1,X2) | d(X1) | ~d(X2), inference(clausification, [status(esa)], [def_forallprefers])).
% 41.00/15.75  cnf(c22, plain, X0(X1,X2) | X1 != false | X2 != true, inference(clausification, [status(esa)], [def_forallprefers])).
% 41.00/15.75  cnf(c39, plain, phi(X0) = X0 | ~d(X0), inference(clausification, [status(esa)], [def_phi])).
% 41.00/15.75  cnf(c42, plain, prop(X0) = true | ~bool(X0), inference(clausification, [status(esa)], [prop_true])).
% 41.00/15.75  cnf(c44, plain, prop(X0) = false | bool(X0), inference(clausification, [status(esa)], [prop_false])).
% 41.00/15.75  cnf(c50, plain, 'lazy$uimpl'(false,X0) = true, inference(clausification, [status(esa)], [lazy_impl_axiom2])).
% 41.00/15.75  cnf(c51, plain, 'lazy$uimpl'(true,X0) = phi(X0), inference(clausification, [status(esa)], [lazy_impl_axiom3])).
% 41.00/15.75  cnf(c80, plain, false1 = false, inference(clausification, [status(esa)], [def_false1])).
% 41.00/15.75  cnf(c81, plain, f7(X0) = 'lazy$uimpl'(prop(X0),X0), inference(clausification, [status(esa)], [def_f7])).
% 41.00/15.75  cnf(c82, plain, false2 = phi(f7(sK75)), inference(clausification, [status(esa)], [def_false2])).
% 41.00/15.75  cnf(c83, plain, ~forallprefers(f7(X0),f7(sK75)), inference(clausification, [status(esa)], [def_false2])).
% 41.00/15.75  cnf(c88, plain, false1 != false2, inference(clausification, [status(esa)], [negated_conjecture])).
% 41.00/15.75  cnf(d0, plain, X0 != true | 'Ts2'(false,X0), inference(equality_resolution, [status(thm)], [c22])).
% 41.00/15.75  cnf(d1, plain, 'Ts2'(false,true), inference(equality_resolution, [status(thm)], [d0])).
% 41.00/15.75  cnf(d2, plain, forallprefers(false,true), inference(resolution, [status(thm)], [d1,c10])).
% 41.00/15.75  cnf(d3, plain, forallprefers(false,X0) | X0 = false | ~bool(X0), inference(superposition, [status(thm)], [c0,d2])).
% 41.00/15.75  cnf(d4, plain, false2 = f7(sK75) | ~d(f7(sK75)), inference(superposition, [status(thm)], [c39,c82])).
% 41.00/15.75  cnf(d5, plain, d(X0) | ~d(X1) | forallprefers(X0,X1), inference(resolution, [status(thm)], [c20,c10])).
% 41.00/15.75  cnf(d6, plain, ~d(f7(sK75)) | d(f7(X0)), inference(resolution, [status(thm)], [d5,c83])).
% 41.00/15.75  cnf(d7, plain, f7(X0) = 'lazy$uimpl'(true,X0) | ~bool(X0), inference(superposition, [status(thm)], [c42,c81])).
% 41.00/15.75  cnf(d8, plain, f7(X0) = phi(X0) | ~bool(X0), inference(demodulation, [status(thm)], [d7,c51])).
% 41.00/15.75  cnf(d9, plain, ~d(phi(sK75)) | d(f7(X0)) | ~bool(sK75), inference(superposition, [status(thm)], [d8,d6])).
% 41.00/15.75  cnf(d10, plain, ~d(sK75) | ~bool(sK75) | d(f7(X0)) | ~d(sK75), inference(superposition, [status(thm)], [c39,d9])).
% 41.00/15.75  cnf(d11, plain, f7(X0) = 'lazy$uimpl'(false,X0) | bool(X0), inference(superposition, [status(thm)], [c44,c81])).
% 41.00/15.75  cnf(d12, plain, f7(X0) = true | bool(X0), inference(demodulation, [status(thm)], [d11,c50])).
% 41.00/15.75  cnf(d13, plain, ~forallprefers(f7(X0),true) | bool(sK75), inference(superposition, [status(thm)], [d12,c83])).
% 41.00/15.75  cnf(d14, plain, ~forallprefers(phi(X0),true) | bool(sK75) | ~bool(X0), inference(superposition, [status(thm)], [d8,d13])).
% 41.00/15.75  cnf(d15, plain, ~forallprefers(X0,true) | ~bool(X0) | bool(sK75) | ~d(X0), inference(superposition, [status(thm)], [c39,d14])).
% 41.00/15.75  cnf(d16, plain, ~bool(false) | bool(sK75) | ~d(false), inference(resolution, [status(thm)], [d15,d2])).
% 41.00/15.75  cnf(d17, plain, ~bool(false) | bool(sK75), inference(resolution, [status(thm)], [c7,d16])).
% 41.00/15.75  cnf(d18, plain, bool(false), inference(equality_resolution, [status(thm)], [c1])).
% 41.00/15.75  cnf(d19, plain, bool(sK75), inference(resolution, [status(thm)], [d18,d17])).
% 41.00/15.75  cnf(d20, plain, d(f7(X0)) | ~d(sK75), inference(resolution, [status(thm)], [d19,d10])).
% 41.00/15.75  cnf(d21, plain, d(X0) | X0 = false | ~bool(X0), inference(superposition, [status(thm)], [c0,c6])).
% 41.00/15.75  cnf(d22, plain, d(X0) | ~bool(X0) | d(X0), inference(superposition, [status(thm)], [d21,c7])).
% 41.00/15.75  cnf(d23, plain, d(sK75), inference(resolution, [status(thm)], [d19,d22])).
% 41.00/15.75  cnf(d24, plain, d(f7(X0)), inference(resolution, [status(thm)], [d23,d20])).
% 41.00/15.75  cnf(d25, plain, false2 = f7(sK75), inference(resolution, [status(thm)], [d24,d4])).
% 41.00/15.75  cnf(d26, plain, ~forallprefers(phi(X0),f7(sK75)) | ~bool(X0), inference(superposition, [status(thm)], [d8,c83])).
% 41.00/15.75  cnf(d27, plain, ~forallprefers(X0,f7(sK75)) | ~bool(X0) | ~d(X0), inference(superposition, [status(thm)], [c39,d26])).
% 41.00/15.75  cnf(d28, plain, ~bool(X0) | ~d(X0) | ~forallprefers(X0,false2), inference(demodulation, [status(thm)], [d27,d25])).
% 41.00/15.75  cnf(d29, plain, ~bool(false) | ~d(false) | false2 = false | ~bool(false2), inference(resolution, [status(thm)], [d28,d3])).
% 41.00/15.75  cnf(d30, plain, false2 = false | ~bool(false) | ~bool(false2), inference(resolution, [status(thm)], [c7,d29])).
% 41.00/15.75  cnf(d31, plain, false2 = false | ~bool(false2), inference(resolution, [status(thm)], [d18,d30])).
% 41.00/15.75  cnf(d32, plain, false2 = phi(phi(sK75)) | ~bool(sK75), inference(superposition, [status(thm)], [d8,c82])).
% 41.00/15.75  cnf(d33, plain, false2 = phi(sK75) | ~bool(sK75) | ~d(sK75), inference(superposition, [status(thm)], [c39,d32])).
% 41.00/15.75  cnf(d34, plain, false2 = sK75 | ~d(sK75) | ~bool(sK75) | ~d(sK75), inference(superposition, [status(thm)], [d33,c39])).
% 41.00/15.75  cnf(d35, plain, false2 = sK75 | ~d(sK75), inference(resolution, [status(thm)], [d19,d34])).
% 41.00/15.75  cnf(d36, plain, false2 = sK75, inference(resolution, [status(thm)], [d23,d35])).
% 41.00/15.75  cnf(d37, plain, bool(false2), inference(demodulation, [status(thm)], [d19,d36])).
% 41.00/15.75  cnf(d38, plain, false2 = false, inference(resolution, [status(thm)], [d37,d31])).
% 41.00/15.75  cnf(d39, plain, false != false2, inference(demodulation, [status(thm)], [c88,c80])).
% 41.00/15.75  cnf(d40, plain, false != false, inference(demodulation, [status(thm)], [d39,d38])).
% 41.00/15.75  cnf(d41, plain, $false, inference(equality_resolution, [status(thm)], [d40])).
% 41.00/15.75  % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------