TSTP Solution File: CSR032+4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR032+4 : TPTP v8.1.0. Released v3.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 : n029.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:36:10 EDT 2022
% Result : Theorem 1.29s 1.31s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR032+4 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n029.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 : Thu Jun 9 18:53:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.29/1.31 % SZS status Theorem
% 1.29/1.31 % SZS output begin IncompleteProof
% 1.29/1.31 cnf(c0, axiom,
% 1.29/1.31 ~isa(f_citynamedfn(s_agen,c_france),X0)).
% 1.29/1.31 cnf(c1, plain,
% 1.29/1.31 ~isa(f_citynamedfn(s_agen,c_france),X0),
% 1.29/1.31 inference(start, [], [c0])).
% 1.29/1.31
% 1.29/1.31 cnf(c2, axiom,
% 1.29/1.31 isa(X1,c_thing) | ~thing(X1)).
% 1.29/1.31 cnf(a0, assumption,
% 1.29/1.31 f_citynamedfn(s_agen,c_france) = X1).
% 1.29/1.31 cnf(a1, assumption,
% 1.29/1.31 X0 = c_thing).
% 1.29/1.31 cnf(c3, plain,
% 1.29/1.31 $false,
% 1.29/1.31 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.29/1.31 cnf(c4, plain,
% 1.29/1.31 ~thing(X1),
% 1.29/1.31 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.29/1.31
% 1.29/1.31 cnf(c5, axiom,
% 1.29/1.31 thing(X2)).
% 1.29/1.31 cnf(a2, assumption,
% 1.29/1.31 X1 = X2).
% 1.29/1.31 cnf(c6, plain,
% 1.29/1.31 $false,
% 1.29/1.31 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 1.29/1.31 cnf(c7, plain,
% 1.29/1.31 $false,
% 1.29/1.31 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 1.29/1.31
% 1.29/1.31 cnf(c8, plain,
% 1.29/1.31 $false,
% 1.29/1.31 inference(constraint_solving, [
% 1.29/1.31 bind(X0, c_thing),
% 1.29/1.31 bind(X1, f_citynamedfn(s_agen,c_france)),
% 1.29/1.31 bind(X2, f_citynamedfn(s_agen,c_france))
% 1.29/1.31 ],
% 1.29/1.31 [a0, a1, a2])).
% 1.29/1.31
% 1.29/1.31 % SZS output end IncompleteProof
%------------------------------------------------------------------------------