TSTP Solution File: SWC102+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWC102+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 : n032.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:07:09 EDT 2022
% Result : Theorem 21.14s 3.15s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWC102+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.10 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sun Jun 12 09:25:40 EDT 2022
% 0.09/0.29 % CPUTime :
% 21.14/3.15 % SZS status Theorem
% 21.14/3.15 % SZS output begin IncompleteProof
% 21.14/3.15 cnf(c0, axiom,
% 21.14/3.15 sK89 = sK91).
% 21.14/3.15 cnf(c1, plain,
% 21.14/3.15 sK89 = sK91,
% 21.14/3.15 inference(start, [], [c0])).
% 21.14/3.15
% 21.14/3.15 cnf(c2, axiom,
% 21.14/3.15 sK90 = sK91).
% 21.14/3.15 cnf(a0, assumption,
% 21.14/3.15 sK91 = sK91).
% 21.14/3.15 cnf(a1, assumption,
% 21.14/3.15 sK89 = X0).
% 21.14/3.15 cnf(c3, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 21.14/3.15 cnf(c4, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 21.14/3.15 cnf(c5, plain,
% 21.14/3.15 sK90 = X0,
% 21.14/3.15 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 21.14/3.15
% 21.14/3.15 cnf(c6, axiom,
% 21.14/3.15 sK88 = sK90).
% 21.14/3.15 cnf(a2, assumption,
% 21.14/3.15 sK90 = sK90).
% 21.14/3.15 cnf(c7, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])).
% 21.14/3.15 cnf(c8, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])).
% 21.14/3.15 cnf(c9, plain,
% 21.14/3.15 sK88 = X0,
% 21.14/3.15 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])).
% 21.14/3.15
% 21.14/3.15 cnf(c10, axiom,
% 21.14/3.15 ~frontsegP(sK89,sK88) | ~neq(sK88,nil)).
% 21.14/3.15 cnf(a3, assumption,
% 21.14/3.15 sK88 = sK88).
% 21.14/3.15 cnf(c11, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(strict_subterm_extension, [assumptions([a3])], [c9, c10])).
% 21.14/3.15 cnf(c12, plain,
% 21.14/3.15 ~neq(sK88,nil),
% 21.14/3.15 inference(strict_subterm_extension, [assumptions([a3])], [c9, c10])).
% 21.14/3.15 cnf(c13, plain,
% 21.14/3.15 ~frontsegP(sK89,X0),
% 21.14/3.15 inference(strict_subterm_extension, [assumptions([a3])], [c9, c10])).
% 21.14/3.15
% 21.14/3.15 cnf(c14, axiom,
% 21.14/3.15 frontsegP(X1,X1) | ~ssList(X1)).
% 21.14/3.15 cnf(a4, assumption,
% 21.14/3.15 sK89 = X1).
% 21.14/3.15 cnf(a5, assumption,
% 21.14/3.15 X0 = X1).
% 21.14/3.15 cnf(c15, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(strict_predicate_extension, [assumptions([a4, a5])], [c13, c14])).
% 21.14/3.15 cnf(c16, plain,
% 21.14/3.15 ~ssList(X1),
% 21.14/3.15 inference(strict_predicate_extension, [assumptions([a4, a5])], [c13, c14])).
% 21.14/3.15
% 21.14/3.15 cnf(c17, axiom,
% 21.14/3.15 ssList(sK89)).
% 21.14/3.15 cnf(a6, assumption,
% 21.14/3.15 X1 = sK89).
% 21.14/3.15 cnf(c18, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(strict_predicate_extension, [assumptions([a6])], [c16, c17])).
% 21.14/3.15 cnf(c19, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(strict_predicate_extension, [assumptions([a6])], [c16, c17])).
% 21.14/3.15
% 21.14/3.15 cnf(c20, plain,
% 21.14/3.15 sK88 = X0).
% 21.14/3.15 cnf(a7, assumption,
% 21.14/3.15 sK88 = sK88).
% 21.14/3.15 cnf(c21, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(equality_reduction, [assumptions([a7])], [c12, c20])).
% 21.14/3.15 cnf(c22, plain,
% 21.14/3.15 ~neq(X0,nil),
% 21.14/3.15 inference(equality_reduction, [assumptions([a7])], [c12, c20])).
% 21.14/3.15
% 21.14/3.15 cnf(c23, axiom,
% 21.14/3.15 neq(sK89,nil)).
% 21.14/3.15 cnf(a8, assumption,
% 21.14/3.15 X0 = sK89).
% 21.14/3.15 cnf(a9, assumption,
% 21.14/3.15 nil = nil).
% 21.14/3.15 cnf(c24, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(strict_predicate_extension, [assumptions([a8, a9])], [c22, c23])).
% 21.14/3.15 cnf(c25, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(strict_predicate_extension, [assumptions([a8, a9])], [c22, c23])).
% 21.14/3.15
% 21.14/3.15 cnf(c26, plain,
% 21.14/3.15 $false,
% 21.14/3.15 inference(constraint_solving, [
% 21.14/3.15 bind(X0, sK89),
% 21.14/3.15 bind(X1, sK89)
% 21.14/3.15 ],
% 21.14/3.15 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 21.14/3.15
% 21.14/3.15 % SZS output end IncompleteProof
%------------------------------------------------------------------------------