TSTP Solution File: KRS178+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : KRS178+1 : TPTP v8.1.0. Bugfixed v5.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 : Sun Jul 17 03:13:11 EDT 2022
% Result : Theorem 0.10s 0.30s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : KRS178+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.02/0.10 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Tue Jun 7 17:05:51 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.10/0.30 % SZS status Theorem
% 0.10/0.30 % SZS output begin IncompleteProof
% 0.10/0.30 cnf(c0, axiom,
% 0.10/0.30 ~isa(sK29,sK29)).
% 0.10/0.30 cnf(c1, plain,
% 0.10/0.30 ~isa(sK29,sK29),
% 0.10/0.30 inference(start, [], [c0])).
% 0.10/0.30
% 0.10/0.30 cnf(c2, axiom,
% 0.10/0.30 isa(X0,X1) | status(sK3(X0,X1),sK4(X0,X1),X0)).
% 0.10/0.30 cnf(a0, assumption,
% 0.10/0.30 sK29 = X0).
% 0.10/0.30 cnf(a1, assumption,
% 0.10/0.30 sK29 = X1).
% 0.10/0.30 cnf(c3, plain,
% 0.10/0.30 $false,
% 0.10/0.30 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.10/0.30 cnf(c4, plain,
% 0.10/0.30 status(sK3(X0,X1),sK4(X0,X1),X0),
% 0.10/0.30 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.10/0.30
% 0.10/0.30 cnf(c5, axiom,
% 0.10/0.30 isa(X2,X3) | ~status(sK3(X2,X3),sK4(X2,X3),X3)).
% 0.10/0.30 cnf(a2, assumption,
% 0.10/0.30 sK3(X0,X1) = sK3(X2,X3)).
% 0.10/0.30 cnf(a3, assumption,
% 0.10/0.30 sK4(X0,X1) = sK4(X2,X3)).
% 0.10/0.30 cnf(a4, assumption,
% 0.10/0.30 X0 = X3).
% 0.10/0.30 cnf(c6, plain,
% 0.10/0.30 $false,
% 0.10/0.30 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 0.10/0.30 cnf(c7, plain,
% 0.10/0.30 isa(X2,X3),
% 0.10/0.30 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 0.10/0.30
% 0.10/0.30 cnf(c8, plain,
% 0.10/0.30 ~isa(sK29,sK29)).
% 0.10/0.30 cnf(a5, assumption,
% 0.10/0.30 X2 = sK29).
% 0.10/0.30 cnf(a6, assumption,
% 0.10/0.30 X3 = sK29).
% 0.10/0.30 cnf(c9, plain,
% 0.10/0.30 $false,
% 0.10/0.30 inference(predicate_reduction, [assumptions([a5, a6])], [c7, c8])).
% 0.10/0.30
% 0.10/0.30 cnf(c10, plain,
% 0.10/0.30 $false,
% 0.10/0.30 inference(constraint_solving, [
% 0.10/0.30 bind(X0, sK29),
% 0.10/0.30 bind(X1, sK29),
% 0.10/0.30 bind(X2, sK29),
% 0.10/0.30 bind(X3, sK29)
% 0.10/0.30 ],
% 0.10/0.30 [a0, a1, a2, a3, a4, a5, a6])).
% 0.10/0.30
% 0.10/0.30 % SZS output end IncompleteProof
%------------------------------------------------------------------------------