TSTP Solution File: CSR027-10 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : CSR027-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %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  : 600s
% DateTime : Fri Jul 15 23:03:43 EDT 2022

% Result   : Unsatisfiable 0.79s 1.10s
% Output   : Refutation 0.79s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR027-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.34  % Computer : n011.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sat Jun 11 05:37:01 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.47/1.05  ============================== Prover9 ===============================
% 0.47/1.05  Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.05  Process 15618 was started by sandbox on n011.cluster.edu,
% 0.47/1.05  Sat Jun 11 05:37:02 2022
% 0.47/1.05  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15465_n011.cluster.edu".
% 0.47/1.05  ============================== end of head ===========================
% 0.47/1.05  
% 0.47/1.05  ============================== INPUT =================================
% 0.47/1.05  
% 0.47/1.05  % Reading from file /tmp/Prover9_15465_n011.cluster.edu
% 0.47/1.05  
% 0.47/1.05  set(prolog_style_variables).
% 0.47/1.05  set(auto2).
% 0.47/1.05      % set(auto2) -> set(auto).
% 0.47/1.05      % set(auto) -> set(auto_inference).
% 0.47/1.05      % set(auto) -> set(auto_setup).
% 0.47/1.05      % set(auto_setup) -> set(predicate_elim).
% 0.47/1.05      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.05      % set(auto) -> set(auto_limits).
% 0.47/1.05      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.05      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.05      % set(auto) -> set(auto_denials).
% 0.47/1.05      % set(auto) -> set(auto_process).
% 0.47/1.05      % set(auto2) -> assign(new_constants, 1).
% 0.47/1.05      % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.05      % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.05      % set(auto2) -> assign(max_hours, 1).
% 0.47/1.05      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.05      % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.05      % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.05      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.05      % set(auto2) -> set(sort_initial_sos).
% 0.47/1.05      % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.05      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.05      % set(auto2) -> assign(max_megs, 400).
% 0.47/1.05      % set(auto2) -> assign(stats, some).
% 0.47/1.05      % set(auto2) -> clear(echo_input).
% 0.47/1.05      % set(auto2) -> set(quiet).
% 0.47/1.05      % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.05      % set(auto2) -> clear(print_given).
% 0.47/1.05  assign(lrs_ticks,-1).
% 0.47/1.05  assign(sos_limit,10000).
% 0.47/1.05  assign(order,kbo).
% 0.47/1.05  set(lex_order_vars).
% 0.47/1.05  clear(print_given).
% 0.47/1.05  
% 0.47/1.05  % formulas(sos).  % not echoed (85 formulas)
% 0.47/1.05  
% 0.47/1.05  ============================== end of input ==========================
% 0.47/1.05  
% 0.47/1.05  % From the command line: assign(max_seconds, 300).
% 0.47/1.05  
% 0.47/1.05  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.05  
% 0.47/1.05  % Formulas that are not ordinary clauses:
% 0.47/1.05  
% 0.47/1.05  ============================== end of process non-clausal formulas ===
% 0.47/1.05  
% 0.47/1.05  ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.05  
% 0.47/1.05  ============================== PREDICATE ELIMINATION =================
% 0.47/1.05  
% 0.47/1.05  ============================== end predicate elimination =============
% 0.47/1.05  
% 0.47/1.05  Auto_denials:
% 0.47/1.05    % copying label goal to answer in negative clause
% 0.47/1.05  
% 0.47/1.05  Term ordering decisions:
% 0.47/1.05  Function symbol KB weights:  true=1. c_movement_translationevent=1. c_unitvectorinterval=1. c_directionoftranslation_throughout=1. b=1. c_tptpcol_16_31868=1. c_basekb=1. c_tptp_member2610_mt=1. c_tptp_spindlecollectormt=1. c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786=1. a=1. c_calendarsmt=1. c_calendarsvocabularymt=1. c_cyclistsmt=1. c_relationallexistsfn=1. c_tptp_8_875=1. c_tptp_member3993_mt=1. c_tptp_spindleheadmt=1. c_transitivebinarypredicate=1. c_universalvocabularymt=1. n_1=1. n_2=1. n_3=1. n_4=1. c_genlmt=1. c_subcollectionofwithrelationfromtypefn=1. isa=1. genlmt=1. genlpreds=1. disjointwith=1. genlinverse=1. directionoftranslation_throughout=1. tptp_8_875=1. genls=1. resultisaarg=1. natfunction=1. tuple2=1. subevents=1. collection=1. mtvisible=1. microtheory=1. predicate=1. subcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent=1. binarypredicate=1. movement_translationevent=1. thing=1. tptpcol_16_31868=1. transitivebinarypredicate=1. unitvectorinterval=1. function_denotational=1. positiveinteger=1. tptpcol_4_24578=1. f_subcollectionofwithrelationfromtypefn=1. natargument=1. relationallexists=1. tuple=1. ifeq3=1. f_relationallexistsfn=1. ifeq=1. ifeq2=1.
% 0.47/1.05  
% 0.47/1.05  ============================== end of process initial clauses ========
% 0.47/1.05  
% 0.47/1.05  ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.05  
% 0.47/1.05  ============================== end of clauses for search =============
% 0.47/1.05  
% 0.47/1.05  ============================== SEARCH ================================
% 0.79/1.10  
% 0.79/1.10  % Starting search at 0.01 seconds.
% 0.79/1.10  
% 0.79/1.10  ============================== PROOF =================================
% 0.79/1.10  % SZS status Unsatisfiable
% 0.79/1.10  % SZS output start Refutation
% 0.79/1.10  
% 0.79/1.10  % Proof 1 at 0.07 (+ 0.00) seconds: goal.
% 0.79/1.10  % Length of proof is 22.
% 0.79/1.10  % Level of proof is 6.
% 0.79/1.10  % Maximum clause weight is 26.000.
% 0.79/1.10  % Given clauses 284.
% 0.79/1.10  
% 0.79/1.10  5 mtvisible(c_tptp_spindlecollectormt) = true # label(query27) # label(negated_conjecture).  [assumption].
% 0.79/1.10  12 genlmt(c_tptp_spindlecollectormt,c_tptp_member2610_mt) = true # label(just9) # label(axiom).  [assumption].
% 0.79/1.10  15 ifeq3(A,A,B,C) = B # label(ifeq_axiom) # label(axiom).  [assumption].
% 0.79/1.10  16 ifeq2(A,A,B,C) = B # label(ifeq_axiom_001) # label(axiom).  [assumption].
% 0.79/1.10  19 isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) = true # label(just14) # label(axiom).  [assumption].
% 0.79/1.10  36 ifeq3(isa(A,c_tptpcol_16_31868),true,tptpcol_16_31868(A),true) = true # label(just34) # label(axiom).  [assumption].
% 0.79/1.10  70 ifeq3(mtvisible(c_tptp_member2610_mt),true,relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),true) = true # label(just13) # label(axiom).  [assumption].
% 0.79/1.10  71 ifeq2(tuple2(tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,A),tptpcol_16_31868(A)),tuple2(true,true),a,b) = b # label(query27_1) # label(negated_conjecture).  [assumption].
% 0.79/1.10  72 ifeq3(genlmt(A,B),true,ifeq3(mtvisible(A),true,mtvisible(B),true),true) = true # label(just63) # label(axiom).  [assumption].
% 0.79/1.10  83 ifeq3(relationallexists(A,B,C),true,ifeq3(isa(D,B),true,isa(f_relationallexistsfn(D,A,B,C),C),true),true) = true # label(just1) # label(axiom).  [assumption].
% 0.79/1.10  84 ifeq3(mtvisible(c_tptp_member2610_mt),true,ifeq3(isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)),true,tptp_8_875(A,f_relationallexistsfn(A,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)),true),true) = true # label(just12) # label(axiom).  [assumption].
% 0.79/1.10  85 a != b # label(goal) # label(negated_conjecture) # answer(goal).  [assumption].
% 0.79/1.10  117 mtvisible(c_tptp_member2610_mt) = true.  [para(12(a,1),72(a,1,1)),rewrite([5(4),15(8),15(6)])].
% 0.79/1.10  120 ifeq3(isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)),true,tptp_8_875(A,f_relationallexistsfn(A,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)),true) = true.  [back_rewrite(84),rewrite([117(2),15(20)])].
% 0.79/1.10  121 relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868) = true.  [back_rewrite(70),rewrite([117(2),15(11)])].
% 0.79/1.10  155 ifeq3(relationallexists(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),B),true,isa(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),B),B),true) = true.  [para(19(a,1),83(a,1,3,1)),rewrite([15(17)])].
% 0.79/1.10  242 tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)) = true.  [para(19(a,1),120(a,1,1)),rewrite([15(14)])].
% 0.79/1.10  308 isa(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868) = true.  [para(121(a,1),155(a,1,1)),rewrite([15(14)])].
% 0.79/1.10  311 ifeq2(tuple2(true,tptpcol_16_31868(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868))),tuple2(true,true),a,b) = b.  [para(242(a,1),71(a,1,1,1))].
% 0.79/1.10  313 tptpcol_16_31868(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)) = true.  [para(308(a,1),36(a,1,1)),rewrite([15(13)])].
% 0.79/1.10  319 a = b.  [back_rewrite(311),rewrite([313(10),16(9)])].
% 0.79/1.10  320 $F # answer(goal).  [resolve(319,a,85,a)].
% 0.79/1.10  
% 0.79/1.10  % SZS output end Refutation
% 0.79/1.10  ============================== end of proof ==========================
% 0.79/1.10  
% 0.79/1.10  ============================== STATISTICS ============================
% 0.79/1.10  
% 0.79/1.10  Given=284. Generated=2032. Kept=311. proofs=1.
% 0.79/1.10  Usable=283. Sos=2. Demods=290. Limbo=6, Disabled=104. Hints=0.
% 0.79/1.10  Megabytes=0.33.
% 0.79/1.10  User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
% 0.79/1.10  
% 0.79/1.10  ============================== end of statistics =====================
% 0.79/1.10  
% 0.79/1.10  ============================== end of search =========================
% 0.79/1.10  
% 0.79/1.10  THEOREM PROVED
% 0.79/1.10  % SZS status Unsatisfiable
% 0.79/1.10  
% 0.79/1.10  Exiting with 1 proof.
% 0.79/1.10  
% 0.79/1.10  Process 15618 exit (max_proofs) Sat Jun 11 05:37:02 2022
% 0.79/1.10  Prover9 interrupted
%------------------------------------------------------------------------------