TSTP Solution File: SWC044+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWC044+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n023.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 : Tue Jul 19 21:06:52 EDT 2022
% Result : Theorem 142.90s 19.67s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 : Sun Jun 12 05:30:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 142.90/19.67 % SZS status Theorem
% 142.90/19.67 % SZS output begin IncompleteProof
% 142.90/19.67 cnf(c0, axiom,
% 142.90/19.67 sK89 = sK91).
% 142.90/19.67 cnf(c1, plain,
% 142.90/19.67 sK89 = sK91,
% 142.90/19.67 inference(start, [], [c0])).
% 142.90/19.67
% 142.90/19.67 cnf(c2, axiom,
% 142.90/19.67 nil = sK89).
% 142.90/19.67 cnf(a0, assumption,
% 142.90/19.67 sK89 = sK89).
% 142.90/19.67 cnf(a1, assumption,
% 142.90/19.67 sK91 = X0).
% 142.90/19.67 cnf(c3, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 142.90/19.67 cnf(c4, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 142.90/19.67 cnf(c5, plain,
% 142.90/19.67 nil = X0,
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 142.90/19.67
% 142.90/19.67 cnf(c6, axiom,
% 142.90/19.67 rearsegP(sK91,sK90)).
% 142.90/19.67 cnf(a2, assumption,
% 142.90/19.67 sK91 = X0).
% 142.90/19.67 cnf(a3, assumption,
% 142.90/19.67 nil = X1).
% 142.90/19.67 cnf(c7, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 142.90/19.67 cnf(c8, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 142.90/19.67 cnf(c9, plain,
% 142.90/19.67 rearsegP(X1,sK90),
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 142.90/19.67
% 142.90/19.67 cnf(c10, axiom,
% 142.90/19.67 nil = X2 | ~rearsegP(nil,X2) | ~ssList(X2)).
% 142.90/19.67 cnf(a4, assumption,
% 142.90/19.67 X1 = nil).
% 142.90/19.67 cnf(a5, assumption,
% 142.90/19.67 sK90 = X2).
% 142.90/19.67 cnf(c11, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])).
% 142.90/19.67 cnf(c12, plain,
% 142.90/19.67 nil = X2 | ~ssList(X2),
% 142.90/19.67 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])).
% 142.90/19.67
% 142.90/19.67 cnf(c13, axiom,
% 142.90/19.67 sK88 = sK90).
% 142.90/19.67 cnf(a6, assumption,
% 142.90/19.67 sK90 = X2).
% 142.90/19.67 cnf(a7, assumption,
% 142.90/19.67 nil = X3).
% 142.90/19.67 cnf(c14, plain,
% 142.90/19.67 ~ssList(X2),
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a6, a7])], [c12, c13])).
% 142.90/19.67 cnf(c15, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a6, a7])], [c12, c13])).
% 142.90/19.67 cnf(c16, plain,
% 142.90/19.67 sK88 = X3,
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a6, a7])], [c12, c13])).
% 142.90/19.67
% 142.90/19.67 cnf(c17, axiom,
% 142.90/19.67 nil != sK88).
% 142.90/19.67 cnf(a8, assumption,
% 142.90/19.67 sK88 = sK88).
% 142.90/19.67 cnf(c18, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a8])], [c16, c17])).
% 142.90/19.67 cnf(c19, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a8])], [c16, c17])).
% 142.90/19.67 cnf(c20, plain,
% 142.90/19.67 nil != X3,
% 142.90/19.67 inference(strict_subterm_extension, [assumptions([a8])], [c16, c17])).
% 142.90/19.67
% 142.90/19.67 cnf(a9, assumption,
% 142.90/19.67 nil = X3).
% 142.90/19.67 cnf(c21, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(reflexivity, [assumptions([a9])], [c20])).
% 142.90/19.67
% 142.90/19.67 cnf(c22, axiom,
% 142.90/19.67 ssList(sK90)).
% 142.90/19.67 cnf(a10, assumption,
% 142.90/19.67 X2 = sK90).
% 142.90/19.67 cnf(c23, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(strict_predicate_extension, [assumptions([a10])], [c14, c22])).
% 142.90/19.67 cnf(c24, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(strict_predicate_extension, [assumptions([a10])], [c14, c22])).
% 142.90/19.67
% 142.90/19.67 cnf(c25, plain,
% 142.90/19.67 $false,
% 142.90/19.67 inference(constraint_solving, [
% 142.90/19.67 bind(X0, sK91),
% 142.90/19.67 bind(X1, nil),
% 142.90/19.67 bind(X2, sK90),
% 142.90/19.67 bind(X3, nil)
% 142.90/19.67 ],
% 142.90/19.67 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 142.90/19.67
% 142.90/19.67 % SZS output end IncompleteProof
%------------------------------------------------------------------------------