%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : PRO011+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n006.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:20:42 AM UTC 2026
% Result : Theorem 16.10s 2.46s
% Output : CNFRefutation 16.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO011+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n006.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sat Sep 26 04:58:10 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.10/2.46 % SZS status Theorem for theBenchmark.p
% 16.10/2.46 % SZS output start CNFRefutation for theBenchmark.p
% 16.10/2.46 fof(sos_07, axiom, ! [X0] : ! [X1] : (('occurrence$uof'(X0,X1) => (arboreal(X0) <=> atomic(X1))))).
% 16.10/2.46 fof(sos_08, axiom, ! [X0] : ((legal(X0) => arboreal(X0)))).
% 16.10/2.46 fof(sos_09, axiom, ! [X0] : ! [X1] : (((legal(X0) & earlier(X1,X0)) => legal(X1)))).
% 16.10/2.46 fof(sos_10, axiom, ! [X0] : ! [X1] : ((precedes(X0,X1) <=> (earlier(X0,X1) & legal(X1))))).
% 16.10/2.46 fof(sos_15, axiom, ! [X0] : ! [X1] : ! [X2] : (('min$uprecedes'(X0,X1,X2) => precedes(X0,X1)))).
% 16.10/2.46 fof(sos_35, axiom, ! [X0] : (('occurrence$uof'(X0,tptp0) => ? [X1] : ? [X2] : ? [X3] : (('occurrence$uof'(X1,tptp3) & ('root$uocc'(X1,X0) & ('occurrence$uof'(X2,tptp4) & ('next$usubocc'(X1,X2,tptp0) & (('occurrence$uof'(X3,tptp1) | 'occurrence$uof'(X3,tptp2)) & ('next$usubocc'(X2,X3,tptp0) & 'leaf$uocc'(X3,X0))))))))))).
% 16.10/2.46 fof(sos_37, axiom, ~atomic(tptp0)).
% 16.10/2.46 fof(goals, conjecture, ! [X0] : (('occurrence$uof'(X0,tptp0) => ? [X1] : ? [X2] : (('leaf$uocc'(X2,X0) & (('occurrence$uof'(X2,tptp1) => ~? [X3] : (('occurrence$uof'(X3,tptp2) & ('subactivity$uoccurrence'(X3,X0) & 'min$uprecedes'(X1,X3,tptp0))))) & ('occurrence$uof'(X2,tptp2) => ~? [X4] : (('occurrence$uof'(X4,tptp1) & ('subactivity$uoccurrence'(X4,X0) & 'min$uprecedes'(X1,X4,tptp0))))))))))).
% 16.10/2.46 fof(negated_conjecture, negated_conjecture, ~! [X0] : (('occurrence$uof'(X0,tptp0) => ? [X1] : ? [X2] : (('leaf$uocc'(X2,X0) & (('occurrence$uof'(X2,tptp1) => ~? [X3] : (('occurrence$uof'(X3,tptp2) & ('subactivity$uoccurrence'(X3,X0) & 'min$uprecedes'(X1,X3,tptp0))))) & ('occurrence$uof'(X2,tptp2) => ~? [X4] : (('occurrence$uof'(X4,tptp1) & ('subactivity$uoccurrence'(X4,X0) & 'min$uprecedes'(X1,X4,tptp0)))))))))), inference(negate_conjecture, [status(cth)], [goals])).
% 16.10/2.46 cnf(c9, plain, ~'occurrence$uof'(X0,X1) | ~arboreal(X0) | atomic(X1), inference(clausification, [status(esa)], [sos_07])).
% 16.10/2.46 cnf(c11, plain, ~legal(X0) | arboreal(X0), inference(clausification, [status(esa)], [sos_08])).
% 16.10/2.46 cnf(c12, plain, ~legal(X0) | ~earlier(X1,X0) | legal(X1), inference(clausification, [status(esa)], [sos_09])).
% 16.10/2.46 cnf(c13, plain, ~precedes(X0,X1) | earlier(X0,X1), inference(clausification, [status(esa)], [sos_10])).
% 16.10/2.46 cnf(c14, plain, ~precedes(X0,X1) | legal(X1), inference(clausification, [status(esa)], [sos_10])).
% 16.10/2.46 cnf(c25, plain, ~'min$uprecedes'(X0,X1,X2) | precedes(X0,X1), inference(clausification, [status(esa)], [sos_15])).
% 16.10/2.46 cnf(c66, plain, ~'occurrence$uof'(X0,tptp0) | X1(X0), inference(clausification, [status(esa)], [sos_35])).
% 16.10/2.46 cnf(c73, plain, ~X0(X1) | 'leaf$uocc'(sK115(X1),X1), inference(clausification, [status(esa)], [sos_35])).
% 16.10/2.46 cnf(c75, plain, ~atomic(tptp0), inference(clausification, [status(esa)], [sos_37])).
% 16.10/2.46 cnf(c86, plain, 'occurrence$uof'(sK117,tptp0), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.10/2.46 cnf(c90, plain, ~'leaf$uocc'(X0,sK117) | ~X1(sK117,X2,X0) | 'min$uprecedes'(X2,sK120(X2),tptp0), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.10/2.46 cnf(c94, plain, X0(X1,X2,X3) | 'min$uprecedes'(X2,sK121(X1,X2),tptp0), inference(clausification, [status(esa)], [negated_conjecture])).
% 16.10/2.46 cnf(d0, plain, ~arboreal(sK117) | atomic(tptp0), inference(resolution, [status(thm)], [c9,c86])).
% 16.10/2.46 cnf(d1, plain, ~arboreal(sK117), inference(resolution, [status(thm)], [c75,d0])).
% 16.10/2.46 cnf(d2, plain, precedes(X0,sK121(X1,X0)) | 'Ts116'(X1,X0,X2), inference(resolution, [status(thm)], [c25,c94])).
% 16.10/2.46 cnf(d3, plain, 'Ts116'(X0,X1,X2) | legal(sK121(X0,X1)), inference(resolution, [status(thm)], [d2,c14])).
% 16.10/2.46 cnf(d4, plain, 'Ts116'(X0,X1,X2) | earlier(X1,sK121(X0,X1)), inference(resolution, [status(thm)], [d2,c13])).
% 16.10/2.46 cnf(d5, plain, 'Ts116'(X0,X1,X2) | ~legal(sK121(X0,X1)) | legal(X1), inference(resolution, [status(thm)], [d4,c12])).
% 16.10/2.46 cnf(d6, plain, legal(X0) | 'Ts116'(X1,X0,X2) | 'Ts116'(X1,X0,X3), inference(resolution, [status(thm)], [d5,d3])).
% 16.10/2.46 cnf(d7, plain, legal(X0) | 'Ts116'(X1,X0,X2), inference(factoring, [status(thm)], [d6])).
% 16.10/2.46 cnf(d8, plain, 'min$uprecedes'(X0,sK120(X0),tptp0) | ~'leaf$uocc'(X1,sK117) | legal(X0), inference(resolution, [status(thm)], [c90,d7])).
% 16.10/2.46 cnf(d9, plain, legal(X0) | 'min$uprecedes'(X0,sK120(X0),tptp0) | ~'Ts111'(sK117), inference(resolution, [status(thm)], [d8,c73])).
% 16.10/2.46 cnf(d10, plain, 'Ts111'(sK117), inference(resolution, [status(thm)], [c66,c86])).
% 16.10/2.46 cnf(d11, plain, legal(X0) | 'min$uprecedes'(X0,sK120(X0),tptp0), inference(resolution, [status(thm)], [d10,d9])).
% 16.10/2.46 cnf(d12, plain, legal(X0) | precedes(X0,sK120(X0)), inference(resolution, [status(thm)], [d11,c25])).
% 16.10/2.46 cnf(d13, plain, legal(X0) | legal(sK120(X0)), inference(resolution, [status(thm)], [d12,c14])).
% 16.10/2.46 cnf(d14, plain, legal(X0) | earlier(X0,sK120(X0)), inference(resolution, [status(thm)], [d12,c13])).
% 16.10/2.46 cnf(d15, plain, legal(X0) | ~legal(sK120(X0)) | legal(X0), inference(resolution, [status(thm)], [d14,c12])).
% 16.10/2.46 cnf(d16, plain, legal(X0) | legal(X0), inference(resolution, [status(thm)], [d15,d13])).
% 16.10/2.46 cnf(d17, plain, arboreal(X0), inference(resolution, [status(thm)], [d16,c11])).
% 16.10/2.46 cnf(d18, plain, $false, inference(resolution, [status(thm)], [d17,d1])).
% 16.10/2.46 % SZS output end CNFRefutation for theBenchmark.p
%------------------------------------------------------------------------------