TSTP Solution File: AGT017+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : AGT017+2 : TPTP v8.1.0. Bugfixed v3.1.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 : Thu Jul 14 12:00:50 EDT 2022
% Result : Theorem 0.10s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : AGT017+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.09/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.10/0.31 % Computer : n032.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Sat Jun 4 03:17:47 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.10/0.34 % SZS status Theorem
% 0.10/0.34 % SZS output begin IncompleteProof
% 0.10/0.34 cnf(c0, axiom,
% 0.10/0.34 accept_city(muslimcountrybhumanitarianorganization,X0)).
% 0.10/0.34 cnf(c1, plain,
% 0.10/0.34 accept_city(muslimcountrybhumanitarianorganization,X0),
% 0.10/0.34 inference(start, [], [c0])).
% 0.10/0.34
% 0.10/0.34 cnf(c2, axiom,
% 0.10/0.34 ~accept_city(muslimcountrybhumanitarianorganization,towna)).
% 0.10/0.34 cnf(a0, assumption,
% 0.10/0.34 muslimcountrybhumanitarianorganization = muslimcountrybhumanitarianorganization).
% 0.10/0.34 cnf(a1, assumption,
% 0.10/0.34 X0 = towna).
% 0.10/0.34 cnf(c3, plain,
% 0.10/0.34 $false,
% 0.10/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.10/0.34 cnf(c4, plain,
% 0.10/0.34 $false,
% 0.10/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.10/0.34
% 0.10/0.34 cnf(c5, plain,
% 0.10/0.34 $false,
% 0.10/0.34 inference(constraint_solving, [
% 0.10/0.34 bind(X0, towna)
% 0.10/0.34 ],
% 0.10/0.34 [a0, a1])).
% 0.10/0.34
% 0.10/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------