↑ Up

Etableau---0.67.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : MGT112+1 : TPTP v9.3.0. Released v9.3.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 : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:09:55 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.41s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT112+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.37  % Computer : n005.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep  7 14:06:35 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.40  # No SInE strategy applied
% 0.12/0.40  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.40  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.40  #
% 0.12/0.40  # Presaturation interreduction done
% 0.12/0.40  # Number of axioms: 29 Number of unprocessed: 29
% 0.12/0.40  # Tableaux proof search.
% 0.12/0.40  # APR header successfully linked.
% 0.12/0.40  # Hello from C++
% 0.12/0.41  # The folding up rule is enabled...
% 0.12/0.41  # Local unification is enabled...
% 0.12/0.41  # Any saturation attempts will use folding labels...
% 0.12/0.41  # 29 beginning clauses after preprocessing and clausification
% 0.12/0.41  # No conjectures after preprocessing.  Attempting to resurrect them from ax_archive.
% 0.12/0.41  # No conjectures.
% 0.12/0.41  # There are 29 start rule candidates:
% 0.12/0.41  # Found 28 unit axioms.
% 0.12/0.41  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.41  # 29 start rule tableaux created.
% 0.12/0.41  # 1 extension rule candidate clauses
% 0.12/0.41  # 28 unit axiom clauses
% 0.12/0.41  
% 0.12/0.41  # Requested 8, 32 cores available to the main process.
% 0.12/0.41  # Closed tableau found in foldup close cycle with 0 folds and 7 closures done.
% 0.12/0.41  # There were 0 total branch saturation attempts.
% 0.12/0.41  # There were 0 of these attempts blocked.
% 0.12/0.41  # There were 0 deferred branch saturation attempts.
% 0.12/0.41  # There were 0 free duplicated saturations.
% 0.12/0.41  # There were 0 total successful branch saturations.
% 0.12/0.41  # There were 0 successful branch saturations in interreduction.
% 0.12/0.41  # There were 0 successful branch saturations on the branch.
% 0.12/0.41  # There were 0 successful branch saturations after the branch.
% 0.12/0.41  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.41  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.41  # Begin clausification derivation
% 0.12/0.41  
% 0.12/0.41  # End clausification derivation
% 0.12/0.41  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.41  cnf(i_0_25, plain, (proh(f2))).
% 0.12/0.41  cnf(i_0_15, plain, (disability(db))).
% 0.12/0.41  cnf(i_0_2, plain, (agent(bibliothek))).
% 0.12/0.41  cnf(i_0_3, plain, (agent(museen))).
% 0.12/0.41  cnf(i_0_4, plain, (action(read))).
% 0.12/0.41  cnf(i_0_5, plain, (target(museum_api))).
% 0.12/0.41  cnf(i_0_6, plain, (position(l))).
% 0.12/0.41  cnf(i_0_7, plain, (position(n))).
% 0.12/0.41  cnf(i_0_8, plain, (position(im))).
% 0.12/0.41  cnf(i_0_9, plain, (position(db))).
% 0.12/0.41  cnf(i_0_10, plain, (legal_relator(rho1))).
% 0.12/0.41  cnf(i_0_11, plain, (odrl_rel(rho1))).
% 0.12/0.41  cnf(i_0_12, plain, (permission(l))).
% 0.12/0.41  cnf(i_0_13, plain, (no_right(n))).
% 0.12/0.41  cnf(i_0_14, plain, (immunity(im))).
% 0.12/0.41  cnf(i_0_24, plain, (rule(f2))).
% 0.12/0.41  cnf(i_0_26, plain, (aee(f2,bibliothek))).
% 0.12/0.41  cnf(i_0_27, plain, (aer(f2,museen))).
% 0.12/0.41  cnf(i_0_28, plain, (act(f2,read))).
% 0.12/0.41  cnf(i_0_29, plain, (tgt(f2,museum_api))).
% 0.12/0.41  cnf(i_0_16, plain, (bearer(l,bibliothek))).
% 0.12/0.41  cnf(i_0_17, plain, (bearer(n,museen))).
% 0.12/0.41  cnf(i_0_18, plain, (bearer(im,bibliothek))).
% 0.12/0.41  cnf(i_0_19, plain, (bearer(db,museen))).
% 0.12/0.41  cnf(i_0_20, plain, (cnt(l,read,museum_api))).
% 0.12/0.41  cnf(i_0_21, plain, (cnt(n,read,museum_api))).
% 0.12/0.41  cnf(i_0_22, plain, (cnt(im,read,museum_api))).
% 0.12/0.41  cnf(i_0_23, plain, (cnt(db,read,museum_api))).
% 0.12/0.41  cnf(i_0_1, plain, (~cnt(X1,X2,X3)|~bearer(X1,X4)|~disability(X1)|~tgt(X5,X3)|~act(X5,X2)|~aer(X5,X4)|~aee(X5,X6)|~proh(X5))).
% 0.12/0.41  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.12/0.41  # Begin printing tableau
% 0.12/0.41  # Found 9 steps
% 0.12/0.41  cnf(i_0_15, plain, (disability(db)), inference(start_rule)).
% 0.12/0.41  cnf(i_0_31, plain, (disability(db)), inference(extension_rule, [i_0_1])).
% 0.12/0.41  cnf(i_0_66, plain, (~cnt(db,read,museum_api)), inference(closure_rule, [i_0_23])).
% 0.12/0.41  cnf(i_0_67, plain, (~bearer(db,museen)), inference(closure_rule, [i_0_19])).
% 0.12/0.41  cnf(i_0_69, plain, (~tgt(f2,museum_api)), inference(closure_rule, [i_0_29])).
% 0.12/0.41  cnf(i_0_70, plain, (~act(f2,read)), inference(closure_rule, [i_0_28])).
% 0.12/0.41  cnf(i_0_71, plain, (~aer(f2,museen)), inference(closure_rule, [i_0_27])).
% 0.12/0.41  cnf(i_0_72, plain, (~aee(f2,bibliothek)), inference(closure_rule, [i_0_26])).
% 0.12/0.41  cnf(i_0_73, plain, (~proh(f2)), inference(closure_rule, [i_0_25])).
% 0.12/0.41  # End printing tableau
% 0.12/0.41  # SZS output end
% 0.12/0.41  # Branches closed with saturation will be marked with an "s"
% 0.12/0.41  # Child (3383441) has found a proof.
% 0.12/0.41  
% 0.12/0.41  # Closed tableau found in foldup close cycle with 0 folds and 7 closures done.
% 0.12/0.41  # There were 0 total branch saturation attempts.
% 0.12/0.41  # There were 0 of these attempts blocked.
% 0.12/0.41  # There were 0 deferred branch saturation attempts.
% 0.12/0.41  # There were 0 free duplicated saturations.
% 0.12/0.41  # There were 0 total successful branch saturations.
% 0.12/0.41  # There were 0 successful branch saturations in interreduction.
% 0.12/0.41  # There were 0 successful branch saturations on the branch.
% 0.12/0.41  # There were 0 successful branch saturations after the branch.
% 0.12/0.41  # Proof search is over...
% 0.12/0.41  # Freeing feature tree
%------------------------------------------------------------------------------