TSTP Solution File: SWC358-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWC358-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:08:24 EDT 2022
% Result : Unsatisfiable 32.67s 4.71s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC358-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 01:26:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 32.67/4.71 % SZS status Unsatisfiable
% 32.67/4.71 % SZS output begin IncompleteProof
% 32.67/4.71 cnf(c0, axiom,
% 32.67/4.71 sk1 = sk3).
% 32.67/4.71 cnf(c1, plain,
% 32.67/4.71 sk1 = sk3,
% 32.67/4.71 inference(start, [], [c0])).
% 32.67/4.71
% 32.67/4.71 cnf(c2, axiom,
% 32.67/4.71 segmentP(sk4,sk3) | nil = sk3).
% 32.67/4.71 cnf(a0, assumption,
% 32.67/4.71 sk3 = sk3).
% 32.67/4.71 cnf(a1, assumption,
% 32.67/4.71 sk1 = X0).
% 32.67/4.71 cnf(c3, plain,
% 32.67/4.71 $false,
% 32.67/4.71 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 32.67/4.71 cnf(c4, plain,
% 32.67/4.71 nil = sk3,
% 32.67/4.71 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 32.67/4.71 cnf(c5, plain,
% 32.67/4.71 segmentP(sk4,X0),
% 32.67/4.71 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 32.67/4.71
% 32.67/4.71 cnf(c6, axiom,
% 32.67/4.71 sk2 = sk4).
% 32.67/4.71 cnf(a2, assumption,
% 32.67/4.71 sk4 = sk4).
% 32.67/4.71 cnf(c7, plain,
% 32.67/4.71 $false,
% 32.67/4.71 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 32.67/4.71 cnf(c8, plain,
% 32.67/4.71 $false,
% 32.67/4.71 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 32.67/4.71 cnf(c9, plain,
% 32.67/4.71 X1 != sk2 | segmentP(X1,X0),
% 32.67/4.71 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 32.67/4.71
% 32.67/4.71 cnf(a3, assumption,
% 32.67/4.71 X1 = sk2).
% 32.67/4.71 cnf(c10, plain,
% 32.67/4.71 segmentP(X1,X0),
% 32.67/4.71 inference(reflexivity, [assumptions([a3])], [c9])).
% 32.67/4.71
% 32.67/4.71 cnf(c11, axiom,
% 32.67/4.71 ~segmentP(sk2,sk1)).
% 32.67/4.71 cnf(a4, assumption,
% 32.67/4.71 X1 = sk2).
% 32.67/4.71 cnf(a5, assumption,
% 32.67/4.71 X0 = sk1).
% 32.67/4.71 cnf(c12, plain,
% 32.67/4.71 $false,
% 32.67/4.71 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])).
% 32.67/4.71 cnf(c13, plain,
% 32.67/4.71 $false,
% 32.67/4.71 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])).
% 32.67/4.71
% 32.67/4.71 cnf(c14, plain,
% 32.67/4.71 ~segmentP(sk4,sk3)).
% 32.67/4.71 cnf(a6, assumption,
% 32.67/4.71 sk3 = sk3).
% 32.67/4.71 cnf(a7, assumption,
% 32.67/4.71 nil = X2).
% 32.67/4.71 cnf(c15, plain,
% 32.67/4.71 $false,
% 32.67/4.71 inference(subterm_reduction, [assumptions([a6, a7])], [c4, c14])).
% 32.67/4.71 cnf(c16, plain,
% 32.67/4.71 ~segmentP(sk4,X2),
% 32.67/4.71 inference(subterm_reduction, [assumptions([a6, a7])], [c4, c14])).
% 32.67/4.71
% 32.67/4.71 cnf(c17, axiom,
% 32.67/4.71 segmentP(X3,nil) | ~ssList(X3)).
% 32.67/4.71 cnf(a8, assumption,
% 32.67/4.71 sk4 = X3).
% 32.67/4.71 cnf(a9, assumption,
% 32.67/4.71 X2 = nil).
% 32.67/4.71 cnf(c18, plain,
% 32.67/4.71 $false,
% 32.67/4.71 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])).
% 32.67/4.71 cnf(c19, plain,
% 32.67/4.71 ~ssList(X3),
% 32.67/4.71 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])).
% 32.67/4.71
% 32.67/4.71 cnf(c20, axiom,
% 32.67/4.71 ssList(sk4)).
% 32.67/4.71 cnf(a10, assumption,
% 32.67/4.71 X3 = sk4).
% 32.67/4.71 cnf(c21, plain,
% 32.67/4.71 $false,
% 32.67/4.71 inference(strict_predicate_extension, [assumptions([a10])], [c19, c20])).
% 32.67/4.71 cnf(c22, plain,
% 32.67/4.71 $false,
% 32.67/4.71 inference(strict_predicate_extension, [assumptions([a10])], [c19, c20])).
% 32.67/4.71
% 32.67/4.71 cnf(c23, plain,
% 32.67/4.71 $false,
% 32.67/4.71 inference(constraint_solving, [
% 32.67/4.71 bind(X0, sk1),
% 32.67/4.71 bind(X1, sk2),
% 32.67/4.71 bind(X2, nil),
% 32.67/4.71 bind(X3, sk4)
% 32.67/4.71 ],
% 32.67/4.71 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 32.67/4.71
% 32.67/4.71 % SZS output end IncompleteProof
%------------------------------------------------------------------------------