TSTP Solution File: CSR030+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : CSR030+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n011.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:04:04 EDT 2023
% Result : Theorem 0.19s 0.62s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 39
% Syntax : Number of formulae : 55 ( 7 unt; 33 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 15 ~; 10 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 19 >; 9 *; 0 +; 0 <<)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 14 con; 0-0 aty)
% Number of variables : 23 ( 2 sgn; 13 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
c_calendarsmt: $i ).
tff(decl_23,type,
c_calendarsvocabularymt: $i ).
tff(decl_24,type,
genlmt: ( $i * $i ) > $o ).
tff(decl_25,type,
c_genlmt: $i ).
tff(decl_26,type,
transitivebinarypredicate: $i > $o ).
tff(decl_27,type,
c_basekb: $i ).
tff(decl_28,type,
c_universalvocabularymt: $i ).
tff(decl_29,type,
c_cyclistsmt: $i ).
tff(decl_30,type,
c_tptptypes_6_388: $i ).
tff(decl_31,type,
c_tptptypes_5_387: $i ).
tff(decl_32,type,
genlpreds: ( $i * $i ) > $o ).
tff(decl_33,type,
tptptypes_6_388: ( $i * $i ) > $o ).
tff(decl_34,type,
tptptypes_5_387: ( $i * $i ) > $o ).
tff(decl_35,type,
c_tptptypes_7_389: $i ).
tff(decl_36,type,
genlinverse: ( $i * $i ) > $o ).
tff(decl_37,type,
tptptypes_7_389: ( $i * $i ) > $o ).
tff(decl_38,type,
c_tptp_spindleheadmt: $i ).
tff(decl_39,type,
c_tptp_member3393_mt: $i ).
tff(decl_40,type,
mtvisible: $i > $o ).
tff(decl_41,type,
c_pushingwithopenhand: $i ).
tff(decl_42,type,
c_tptpcol_16_4451: $i ).
tff(decl_43,type,
isa: ( $i * $i ) > $o ).
tff(decl_44,type,
disjointwith: ( $i * $i ) > $o ).
tff(decl_45,type,
collection: $i > $o ).
tff(decl_46,type,
genls: ( $i * $i ) > $o ).
tff(decl_47,type,
tptpcol_16_4451: $i > $o ).
tff(decl_48,type,
pushingwithopenhand: $i > $o ).
tff(decl_49,type,
firstordercollection: $i > $o ).
tff(decl_50,type,
binarypredicate: $i > $o ).
tff(decl_51,type,
predicate: $i > $o ).
tff(decl_52,type,
c_transitivebinarypredicate: $i ).
tff(decl_53,type,
thing: $i > $o ).
tff(decl_54,type,
microtheory: $i > $o ).
fof(query30,conjecture,
? [X2] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X2,c_pushingwithopenhand) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query30) ).
fof(just7,axiom,
! [X1,X2] :
( tptptypes_6_388(X1,X2)
=> tptptypes_5_387(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just7) ).
fof(just9,axiom,
! [X1,X2] :
( tptptypes_7_389(X1,X2)
=> tptptypes_6_388(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just9) ).
fof(just12,axiom,
( mtvisible(c_tptp_spindleheadmt)
=> tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just12) ).
fof(just49,axiom,
! [X15,X16] :
( ( mtvisible(X15)
& genlmt(X15,X16) )
=> mtvisible(X16) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just49) ).
fof(just11,axiom,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just11) ).
fof(c_0_6,negated_conjecture,
~ ? [X2] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X2,c_pushingwithopenhand) ),
inference(assume_negation,[status(cth)],[query30]) ).
fof(c_0_7,negated_conjecture,
! [X106] :
( mtvisible(c_tptp_member3393_mt)
& ~ tptptypes_5_387(X106,c_pushingwithopenhand) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_8,plain,
! [X17,X18] :
( ~ tptptypes_6_388(X17,X18)
| tptptypes_5_387(X17,X18) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just7])]) ).
fof(c_0_9,plain,
! [X19,X20] :
( ~ tptptypes_7_389(X19,X20)
| tptptypes_6_388(X20,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])]) ).
fof(c_0_10,plain,
( ~ mtvisible(c_tptp_spindleheadmt)
| tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
inference(fof_nnf,[status(thm)],[just12]) ).
cnf(c_0_11,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X91,X92] :
( ~ mtvisible(X91)
| ~ genlmt(X91,X92)
| mtvisible(X92) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just49])]) ).
cnf(c_0_14,plain,
( tptptypes_6_388(X2,X1)
| ~ tptptypes_7_389(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithopenhand),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[just11]) ).
cnf(c_0_19,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
~ mtvisible(c_tptp_spindleheadmt),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR030+1 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n011.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 : 300
% 0.12/0.34 % DateTime : Mon Aug 28 13:47:10 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.60 start to proof: theBenchmark
% 0.19/0.62 % Version : CSE_E---1.5
% 0.19/0.62 % Problem : theBenchmark.p
% 0.19/0.62 % Proof found
% 0.19/0.62 % SZS status Theorem for theBenchmark.p
% 0.19/0.62 % SZS output start Proof
% See solution above
% 0.19/0.62 % Total time : 0.008000 s
% 0.19/0.62 % SZS output end Proof
% 0.19/0.62 % Total time : 0.011000 s
%------------------------------------------------------------------------------