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