TSTP Solution File: SWC328+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWC328+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 : n017.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:08:16 EDT 2022
% Result : Theorem 4.36s 0.98s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC328+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n017.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 08:56:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 4.36/0.98 % SZS status Theorem
% 4.36/0.98 % SZS output begin IncompleteProof
% 4.36/0.98 cnf(c0, axiom,
% 4.36/0.98 sK88 = sK90).
% 4.36/0.98 cnf(c1, plain,
% 4.36/0.98 sK88 = sK90,
% 4.36/0.98 inference(start, [], [c0])).
% 4.36/0.98
% 4.36/0.98 cnf(c2, axiom,
% 4.36/0.98 nil = sK90).
% 4.36/0.98 cnf(a0, assumption,
% 4.36/0.98 sK90 = sK90).
% 4.36/0.98 cnf(a1, assumption,
% 4.36/0.98 sK88 = X0).
% 4.36/0.98 cnf(c3, plain,
% 4.36/0.98 $false,
% 4.36/0.98 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.36/0.98 cnf(c4, plain,
% 4.36/0.98 $false,
% 4.36/0.98 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.36/0.98 cnf(c5, plain,
% 4.36/0.98 nil = X0,
% 4.36/0.98 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.36/0.98
% 4.36/0.98 cnf(c6, axiom,
% 4.36/0.98 ~equalelemsP(sK88) | ~segmentP(sK89,sK88)).
% 4.36/0.98 cnf(a2, assumption,
% 4.36/0.98 sK88 = X0).
% 4.36/0.98 cnf(a3, assumption,
% 4.36/0.98 nil = X1).
% 4.36/0.98 cnf(c7, plain,
% 4.36/0.98 $false,
% 4.36/0.98 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 4.36/0.98 cnf(c8, plain,
% 4.36/0.98 ~equalelemsP(sK88),
% 4.36/0.98 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 4.36/0.98 cnf(c9, plain,
% 4.36/0.98 ~segmentP(sK89,X1),
% 4.36/0.98 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 4.36/0.98
% 4.36/0.98 cnf(c10, axiom,
% 4.36/0.98 segmentP(X2,nil) | ~ssList(X2)).
% 4.36/0.98 cnf(a4, assumption,
% 4.36/0.98 sK89 = X2).
% 4.36/0.98 cnf(a5, assumption,
% 4.36/0.98 X1 = nil).
% 4.36/0.98 cnf(c11, plain,
% 4.36/0.98 $false,
% 4.36/0.98 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])).
% 4.36/0.98 cnf(c12, plain,
% 4.36/0.98 ~ssList(X2),
% 4.36/0.98 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])).
% 4.36/0.98
% 4.36/0.98 cnf(c13, axiom,
% 4.36/0.98 ssList(sK89)).
% 4.36/0.98 cnf(a6, assumption,
% 4.36/0.98 X2 = sK89).
% 4.36/0.98 cnf(c14, plain,
% 4.36/0.98 $false,
% 4.36/0.98 inference(strict_predicate_extension, [assumptions([a6])], [c12, c13])).
% 4.36/0.98 cnf(c15, plain,
% 4.36/0.98 $false,
% 4.36/0.98 inference(strict_predicate_extension, [assumptions([a6])], [c12, c13])).
% 4.36/0.98
% 4.36/0.98 cnf(c16, plain,
% 4.36/0.98 nil = X0).
% 4.36/0.98 cnf(a7, assumption,
% 4.36/0.98 sK88 = X0).
% 4.36/0.98 cnf(a8, assumption,
% 4.36/0.98 nil = X3).
% 4.36/0.98 cnf(c17, plain,
% 4.36/0.98 $false,
% 4.36/0.98 inference(equality_reduction, [assumptions([a7, a8])], [c8, c16])).
% 4.36/0.98 cnf(c18, plain,
% 4.36/0.98 ~equalelemsP(X3),
% 4.36/0.98 inference(equality_reduction, [assumptions([a7, a8])], [c8, c16])).
% 4.36/0.98
% 4.36/0.98 cnf(c19, axiom,
% 4.36/0.98 equalelemsP(nil)).
% 4.36/0.98 cnf(a9, assumption,
% 4.36/0.98 X3 = nil).
% 4.36/0.98 cnf(c20, plain,
% 4.36/0.98 $false,
% 4.36/0.98 inference(strict_predicate_extension, [assumptions([a9])], [c18, c19])).
% 4.36/0.98 cnf(c21, plain,
% 4.36/0.98 $false,
% 4.36/0.98 inference(strict_predicate_extension, [assumptions([a9])], [c18, c19])).
% 4.36/0.98
% 4.36/0.98 cnf(c22, plain,
% 4.36/0.98 $false,
% 4.36/0.98 inference(constraint_solving, [
% 4.36/0.98 bind(X0, sK88),
% 4.36/0.98 bind(X1, nil),
% 4.36/0.98 bind(X2, sK89),
% 4.36/0.98 bind(X3, nil)
% 4.36/0.98 ],
% 4.36/0.98 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 4.36/0.98
% 4.36/0.98 % SZS output end IncompleteProof
%------------------------------------------------------------------------------