TSTP Solution File: CSR256+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR256+1 : TPTP v8.1.0. Released v7.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 : n021.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 : Fri Jul 15 20:38:22 EDT 2022
% Result : Theorem 2.18s 0.91s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR256+1 : TPTP v8.1.0. Released v7.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 : n021.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 : Sat Jun 11 05:00:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.18/0.91 % SZS status Theorem
% 2.18/0.91 % SZS output begin IncompleteProof
% 2.18/0.91 cnf(c0, axiom,
% 2.18/0.91 ~p__d__subclass(c__Funding,c__SocialInteraction)).
% 2.18/0.91 cnf(c1, plain,
% 2.18/0.91 ~p__d__subclass(c__Funding,c__SocialInteraction),
% 2.18/0.91 inference(start, [], [c0])).
% 2.18/0.91
% 2.18/0.91 cnf(c2, axiom,
% 2.18/0.91 p__d__subclass(X0,X1) | ~p__d__subclass(X2,X1) | ~p__d__subclass(X0,X2)).
% 2.18/0.91 cnf(a0, assumption,
% 2.18/0.91 c__Funding = X0).
% 2.18/0.91 cnf(a1, assumption,
% 2.18/0.91 c__SocialInteraction = X1).
% 2.18/0.91 cnf(c3, plain,
% 2.18/0.91 $false,
% 2.18/0.91 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.18/0.91 cnf(c4, plain,
% 2.18/0.91 ~p__d__subclass(X2,X1) | ~p__d__subclass(X0,X2),
% 2.18/0.91 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.18/0.91
% 2.18/0.91 cnf(c5, axiom,
% 2.18/0.91 p__d__subclass(X3,X4) | ~p__d__subclass(X5,X4) | ~p__d__subclass(X3,X5)).
% 2.18/0.91 cnf(a2, assumption,
% 2.18/0.91 X2 = X3).
% 2.18/0.91 cnf(a3, assumption,
% 2.18/0.91 X1 = X4).
% 2.18/0.91 cnf(c6, plain,
% 2.18/0.91 ~p__d__subclass(X0,X2),
% 2.18/0.91 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.18/0.91 cnf(c7, plain,
% 2.18/0.91 ~p__d__subclass(X5,X4) | ~p__d__subclass(X3,X5),
% 2.18/0.91 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.18/0.91
% 2.18/0.91 cnf(c8, axiom,
% 2.18/0.91 p__d__subclass(c__ChangeOfPossession,c__SocialInteraction)).
% 2.18/0.91 cnf(a4, assumption,
% 2.18/0.91 X5 = c__ChangeOfPossession).
% 2.18/0.91 cnf(a5, assumption,
% 2.18/0.91 X4 = c__SocialInteraction).
% 2.18/0.91 cnf(c9, plain,
% 2.18/0.91 ~p__d__subclass(X3,X5),
% 2.18/0.91 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 2.18/0.91 cnf(c10, plain,
% 2.18/0.91 $false,
% 2.18/0.91 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 2.18/0.91
% 2.18/0.91 cnf(c11, axiom,
% 2.18/0.91 p__d__subclass(c__Giving,c__ChangeOfPossession)).
% 2.18/0.91 cnf(a6, assumption,
% 2.18/0.91 X3 = c__Giving).
% 2.18/0.91 cnf(a7, assumption,
% 2.18/0.91 X5 = c__ChangeOfPossession).
% 2.18/0.91 cnf(c12, plain,
% 2.18/0.91 $false,
% 2.18/0.91 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 2.18/0.91 cnf(c13, plain,
% 2.18/0.91 $false,
% 2.18/0.91 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 2.18/0.91
% 2.18/0.91 cnf(c14, axiom,
% 2.18/0.91 p__d__subclass(c__Funding,c__Giving)).
% 2.18/0.91 cnf(a8, assumption,
% 2.18/0.91 X0 = c__Funding).
% 2.18/0.91 cnf(a9, assumption,
% 2.18/0.91 X2 = c__Giving).
% 2.18/0.91 cnf(c15, plain,
% 2.18/0.91 $false,
% 2.18/0.91 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])).
% 2.18/0.91 cnf(c16, plain,
% 2.18/0.91 $false,
% 2.18/0.91 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])).
% 2.18/0.91
% 2.18/0.91 cnf(c17, plain,
% 2.18/0.91 $false,
% 2.18/0.91 inference(constraint_solving, [
% 2.18/0.91 bind(X0, c__Funding),
% 2.18/0.91 bind(X1, c__SocialInteraction),
% 2.18/0.91 bind(X2, c__Giving),
% 2.18/0.91 bind(X3, c__Giving),
% 2.18/0.91 bind(X4, c__SocialInteraction),
% 2.18/0.91 bind(X5, c__ChangeOfPossession)
% 2.18/0.91 ],
% 2.18/0.91 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 2.18/0.91
% 2.18/0.91 % SZS output end IncompleteProof
%------------------------------------------------------------------------------