TSTP Solution File: CSR032+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : CSR032+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n020.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 : 300s
% DateTime : Wed Aug 30 19:09:12 EDT 2023
% Result : Theorem 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 38
% Syntax : Number of formulae : 45 ( 4 unt; 35 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 20 >; 10 *; 0 +; 0 <<)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 15 con; 0-2 aty)
% Number of variables : 7 ( 1 sgn; 3 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
s_agen: $i ).
tff(decl_23,type,
c_france: $i ).
tff(decl_24,type,
f_citynamedfn: ( $i * $i ) > $i ).
tff(decl_25,type,
individual: $i > $o ).
tff(decl_26,type,
c_trajector_underspecified: $i ).
tff(decl_27,type,
c_location_underspecified: $i ).
tff(decl_28,type,
genls: ( $i * $i ) > $o ).
tff(decl_29,type,
trajector_underspecified: $i > $o ).
tff(decl_30,type,
location_underspecified: $i > $o ).
tff(decl_31,type,
c_thing: $i ).
tff(decl_32,type,
thing: $i > $o ).
tff(decl_33,type,
c_humansociallifemt: $i ).
tff(decl_34,type,
c_basekb: $i ).
tff(decl_35,type,
genlmt: ( $i * $i ) > $o ).
tff(decl_36,type,
c_genlmt: $i ).
tff(decl_37,type,
transitivebinarypredicate: $i > $o ).
tff(decl_38,type,
c_reasoningaboutpossibleantecedentsmt: $i ).
tff(decl_39,type,
c_individual: $i ).
tff(decl_40,type,
c_universalvocabularymt: $i ).
tff(decl_41,type,
isa: ( $i * $i ) > $o ).
tff(decl_42,type,
disjointwith: ( $i * $i ) > $o ).
tff(decl_43,type,
genlinverse: ( $i * $i ) > $o ).
tff(decl_44,type,
genlpreds: ( $i * $i ) > $o ).
tff(decl_45,type,
predicate: $i > $o ).
tff(decl_46,type,
binarypredicate: $i > $o ).
tff(decl_47,type,
collection: $i > $o ).
tff(decl_48,type,
c_transitivebinarypredicate: $i ).
tff(decl_49,type,
mtvisible: $i > $o ).
tff(decl_50,type,
microtheory: $i > $o ).
tff(decl_51,type,
c_citynamedfn: $i ).
tff(decl_52,type,
natfunction: ( $i * $i ) > $o ).
tff(decl_53,type,
n_1: $i ).
tff(decl_54,type,
natargument: ( $i * $i * $i ) > $o ).
tff(decl_55,type,
n_2: $i ).
tff(decl_56,type,
city: $i > $o ).
fof(query32,conjecture,
? [X17] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X17) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query32) ).
fof(just57,axiom,
! [X10] :
( individual(X10)
=> isa(X10,c_individual) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just57) ).
fof(just1,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just1) ).
fof(c_0_3,negated_conjecture,
~ ? [X17] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X17) ),
inference(assume_negation,[status(cth)],[query32]) ).
fof(c_0_4,plain,
! [X105] :
( ~ individual(X105)
| isa(X105,c_individual) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just57])]) ).
fof(c_0_5,negated_conjecture,
! [X125] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
& ~ isa(f_citynamedfn(s_agen,c_france),X125) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_6,plain,
( isa(X1,c_individual)
| ~ individual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(split_conjunct,[status(thm)],[just1]) ).
cnf(c_0_8,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR032+1 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 11:08:29 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.58 % Total time : 0.007000 s
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time : 0.010000 s
%------------------------------------------------------------------------------