TSTP Solution File: SWV416+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV416+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n012.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 : Wed Jul 20 19:46:50 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV416+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 16:10:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.53 % SZS status Theorem
% 0.19/0.53 % SZS output begin IncompleteProof
% 0.19/0.53 cnf(c0, axiom,
% 0.19/0.53 pi_remove(triple(sK5,sK6,sK7),sK8)).
% 0.19/0.53 cnf(c1, plain,
% 0.19/0.53 pi_remove(triple(sK5,sK6,sK7),sK8),
% 0.19/0.53 inference(start, [], [c0])).
% 0.19/0.53
% 0.19/0.53 cnf(c2, axiom,
% 0.19/0.53 pi_sharp_remove(i(X0),X1) | ~pi_remove(X0,X1)).
% 0.19/0.53 cnf(a0, assumption,
% 0.19/0.53 triple(sK5,sK6,sK7) = X0).
% 0.19/0.53 cnf(a1, assumption,
% 0.19/0.53 sK8 = X1).
% 0.19/0.53 cnf(c3, plain,
% 0.19/0.53 $false,
% 0.19/0.53 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.53 cnf(c4, plain,
% 0.19/0.53 pi_sharp_remove(i(X0),X1),
% 0.19/0.53 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.53
% 0.19/0.53 cnf(c5, axiom,
% 0.19/0.53 contains_pq(X2,X3) | ~pi_sharp_remove(X2,X3)).
% 0.19/0.53 cnf(a2, assumption,
% 0.19/0.53 i(X0) = X2).
% 0.19/0.53 cnf(a3, assumption,
% 0.19/0.53 X1 = X3).
% 0.19/0.53 cnf(c6, plain,
% 0.19/0.53 $false,
% 0.19/0.53 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.53 cnf(c7, plain,
% 0.19/0.53 contains_pq(X2,X3),
% 0.19/0.53 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.53
% 0.19/0.53 cnf(c8, axiom,
% 0.19/0.53 i(remove_cpq(triple(X4,X5,X6),X7)) = remove_pq(i(triple(X4,X5,X6)),X7) | ~contains_pq(i(triple(X4,X5,X6)),X7)).
% 0.19/0.53 cnf(a4, assumption,
% 0.19/0.53 X2 = i(triple(X4,X5,X6))).
% 0.19/0.53 cnf(a5, assumption,
% 0.19/0.53 X3 = X7).
% 0.19/0.53 cnf(c9, plain,
% 0.19/0.53 $false,
% 0.19/0.53 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.19/0.53 cnf(c10, plain,
% 0.19/0.53 i(remove_cpq(triple(X4,X5,X6),X7)) = remove_pq(i(triple(X4,X5,X6)),X7),
% 0.19/0.53 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.19/0.53
% 0.19/0.53 cnf(c11, axiom,
% 0.19/0.53 i(remove_cpq(triple(sK5,sK6,sK7),sK8)) != remove_pq(i(triple(sK5,sK6,sK7)),sK8) | ~pi_sharp_remove(i(triple(sK5,sK6,sK7)),sK8)).
% 0.19/0.53 cnf(a6, assumption,
% 0.19/0.53 i(remove_cpq(triple(sK5,sK6,sK7),sK8)) = i(remove_cpq(triple(X4,X5,X6),X7))).
% 0.19/0.53 cnf(a7, assumption,
% 0.19/0.53 remove_pq(i(triple(X4,X5,X6)),X7) = X8).
% 0.19/0.53 cnf(c12, plain,
% 0.19/0.53 $false,
% 0.19/0.53 inference(strict_subterm_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.19/0.53 cnf(c13, plain,
% 0.19/0.53 ~pi_sharp_remove(i(triple(sK5,sK6,sK7)),sK8),
% 0.19/0.53 inference(strict_subterm_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.19/0.53 cnf(c14, plain,
% 0.19/0.53 X8 != remove_pq(i(triple(sK5,sK6,sK7)),sK8),
% 0.19/0.53 inference(strict_subterm_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.19/0.53
% 0.19/0.53 cnf(a8, assumption,
% 0.19/0.53 X8 = remove_pq(i(triple(sK5,sK6,sK7)),sK8)).
% 0.19/0.53 cnf(c15, plain,
% 0.19/0.53 $false,
% 0.19/0.53 inference(reflexivity, [assumptions([a8])], [c14])).
% 0.19/0.53
% 0.19/0.53 cnf(c16, plain,
% 0.19/0.53 pi_sharp_remove(i(X0),X1)).
% 0.19/0.53 cnf(a9, assumption,
% 0.19/0.53 i(triple(sK5,sK6,sK7)) = i(X0)).
% 0.19/0.53 cnf(a10, assumption,
% 0.19/0.53 sK8 = X1).
% 0.19/0.53 cnf(c17, plain,
% 0.19/0.53 $false,
% 0.19/0.53 inference(predicate_reduction, [assumptions([a9, a10])], [c13, c16])).
% 0.19/0.53
% 0.19/0.53 cnf(c18, plain,
% 0.19/0.53 $false,
% 0.19/0.53 inference(constraint_solving, [
% 0.19/0.53 bind(X0, triple(sK5,sK6,sK7)),
% 0.19/0.53 bind(X1, sK8),
% 0.19/0.53 bind(X2, i(X0)),
% 0.19/0.53 bind(X3, sK8),
% 0.19/0.53 bind(X4, sK5),
% 0.19/0.53 bind(X5, sK6),
% 0.19/0.53 bind(X6, sK7),
% 0.19/0.53 bind(X7, sK8),
% 0.19/0.53 bind(X8, remove_pq(i(triple(X4,X5,X6)),X7))
% 0.19/0.53 ],
% 0.19/0.53 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.19/0.53
% 0.19/0.53 % SZS output end IncompleteProof
%------------------------------------------------------------------------------