TSTP Solution File: CSR042+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : CSR042+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n007.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 03:07:43 EDT 2022

% Result   : Theorem 0.21s 0.40s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : CSR042+1 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.15  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36  % Computer : n007.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sat Jun 11 09:05:22 EDT 2022
% 0.14/0.37  % CPUTime  : 
% 0.21/0.40  # No SInE strategy applied
% 0.21/0.40  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.40  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.40  #
% 0.21/0.40  # Presaturation interreduction done
% 0.21/0.40  # Number of axioms: 31 Number of unprocessed: 26
% 0.21/0.40  # Tableaux proof search.
% 0.21/0.40  # APR header successfully linked.
% 0.21/0.40  # Hello from C++
% 0.21/0.40  # The folding up rule is enabled...
% 0.21/0.40  # Local unification is enabled...
% 0.21/0.40  # Any saturation attempts will use folding labels...
% 0.21/0.40  # 26 beginning clauses after preprocessing and clausification
% 0.21/0.40  # Creating start rules for all 2 conjectures.
% 0.21/0.40  # There are 2 start rule candidates:
% 0.21/0.40  # Found 5 unit axioms.
% 0.21/0.40  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.40  # 2 start rule tableaux created.
% 0.21/0.40  # 21 extension rule candidate clauses
% 0.21/0.40  # 5 unit axiom clauses
% 0.21/0.40  
% 0.21/0.40  # Requested 8, 32 cores available to the main process.
% 0.21/0.40  # There are not enough tableaux to fork, creating more from the initial 2
% 0.21/0.40  # Closed tableau found in foldup close cycle with 0 folds and 1 closures done.
% 0.21/0.40  # There were 0 total branch saturation attempts.
% 0.21/0.40  # There were 0 of these attempts blocked.
% 0.21/0.40  # There were 0 deferred branch saturation attempts.
% 0.21/0.40  # There were 0 free duplicated saturations.
% 0.21/0.40  # There were 0 total successful branch saturations.
% 0.21/0.40  # There were 0 successful branch saturations in interreduction.
% 0.21/0.40  # There were 0 successful branch saturations on the branch.
% 0.21/0.40  # There were 0 successful branch saturations after the branch.
% 0.21/0.40  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40  # Begin clausification derivation
% 0.21/0.40  
% 0.21/0.40  # End clausification derivation
% 0.21/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.40  cnf(i_0_31, negated_conjecture, (mtvisible(c_tptpgeo_member7_mt))).
% 0.21/0.40  cnf(i_0_1, plain, (borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65))).
% 0.21/0.40  cnf(i_0_25, plain, (mtvisible(c_basekb))).
% 0.21/0.40  cnf(i_0_30, negated_conjecture, (~borderson(X1,c_georegion_l4_x27_y64))).
% 0.21/0.40  cnf(i_0_29, plain, (~borderson(X1,X1))).
% 0.21/0.40  cnf(i_0_9, plain, (genlpreds(X1,X1)|~predicate(X1))).
% 0.21/0.40  cnf(i_0_26, plain, (geographicalregion(X1)|~borderson(X2,X1))).
% 0.21/0.40  cnf(i_0_4, plain, (predicate(X1)|~genlpreds(X2,X1))).
% 0.21/0.40  cnf(i_0_6, plain, (predicate(X1)|~genlpreds(X1,X2))).
% 0.21/0.40  cnf(i_0_27, plain, (geographicalregion(X1)|~borderson(X1,X2))).
% 0.21/0.40  cnf(i_0_28, plain, (borderson(X1,X2)|~borderson(X2,X1))).
% 0.21/0.40  cnf(i_0_11, plain, (binarypredicate(X1)|~genlinverse(X2,X1))).
% 0.21/0.40  cnf(i_0_12, plain, (binarypredicate(X1)|~genlinverse(X1,X2))).
% 0.21/0.40  cnf(i_0_20, plain, (collection(X1)|~isa(X2,X1))).
% 0.21/0.40  cnf(i_0_15, plain, (collection(X1)|~disjointwith(X2,X1))).
% 0.21/0.40  cnf(i_0_16, plain, (collection(X1)|~disjointwith(X1,X2))).
% 0.21/0.40  cnf(i_0_22, plain, (thing(X1)|~isa(X1,X2))).
% 0.21/0.40  cnf(i_0_17, plain, (disjointwith(X1,X2)|~disjointwith(X2,X1))).
% 0.21/0.40  cnf(i_0_2, plain, (~disjointwith(X1,X2)|~isa(X3,X2)|~isa(X3,X1))).
% 0.21/0.40  cnf(i_0_24, plain, (isa(X1,X2)|~genls(X3,X2)|~isa(X1,X3))).
% 0.21/0.40  cnf(i_0_19, plain, (disjointwith(X1,X2)|~genls(X1,X3)|~disjointwith(X3,X2))).
% 0.21/0.40  cnf(i_0_18, plain, (disjointwith(X1,X2)|~genls(X2,X3)|~disjointwith(X1,X3))).
% 0.21/0.40  cnf(i_0_13, plain, (genlinverse(X1,X2)|~genlpreds(X1,X3)|~genlinverse(X3,X2))).
% 0.21/0.40  cnf(i_0_14, plain, (genlinverse(X1,X2)|~genlpreds(X3,X2)|~genlinverse(X1,X3))).
% 0.21/0.40  cnf(i_0_3, plain, (genlpreds(X1,X2)|~genlinverse(X3,X2)|~genlinverse(X1,X3))).
% 0.21/0.40  cnf(i_0_8, plain, (genlpreds(X1,X2)|~genlpreds(X3,X2)|~genlpreds(X1,X3))).
% 0.21/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.40  # Begin printing tableau
% 0.21/0.40  # Found 3 steps
% 0.21/0.40  cnf(i_0_30, negated_conjecture, (~borderson(c_georegion_l4_x27_y65,c_georegion_l4_x27_y64)), inference(start_rule)).
% 0.21/0.40  cnf(i_0_32, plain, (~borderson(c_georegion_l4_x27_y65,c_georegion_l4_x27_y64)), inference(extension_rule, [i_0_28])).
% 0.21/0.40  cnf(i_0_45, plain, (~borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65)), inference(closure_rule, [i_0_1])).
% 0.21/0.40  # End printing tableau
% 0.21/0.40  # SZS output end
% 0.21/0.40  # Branches closed with saturation will be marked with an "s"
% 0.21/0.40  # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.40  # We now have 2 tableaux to operate on
% 0.21/0.40  # Found closed tableau during pool population.
% 0.21/0.40  # Proof search is over...
% 0.21/0.40  # Freeing feature tree
%------------------------------------------------------------------------------