↑ Up

Etableau---0.67.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LAT269-2 : TPTP v8.1.0. Released v3.2.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 : n010.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 : Sun Jul 17 04:49:55 EDT 2022

% Result   : Unsatisfiable 0.06s 0.28s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07  % Problem  : LAT269-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.08  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.06/0.26  % Computer : n010.cluster.edu
% 0.06/0.26  % Model    : x86_64 x86_64
% 0.06/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26  % Memory   : 8042.1875MB
% 0.06/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26  % CPULimit : 300
% 0.06/0.26  % WCLimit  : 600
% 0.06/0.26  % DateTime : Thu Jun 30 13:32:33 EDT 2022
% 0.06/0.26  % CPUTime  : 
% 0.06/0.28  # No SInE strategy applied
% 0.06/0.28  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.06/0.28  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.06/0.28  #
% 0.06/0.28  # Presaturation interreduction done
% 0.06/0.28  # Number of axioms: 6 Number of unprocessed: 6
% 0.06/0.28  # Tableaux proof search.
% 0.06/0.28  # APR header successfully linked.
% 0.06/0.28  # Hello from C++
% 0.06/0.28  # The folding up rule is enabled...
% 0.06/0.28  # Local unification is enabled...
% 0.06/0.28  # Any saturation attempts will use folding labels...
% 0.06/0.28  # 6 beginning clauses after preprocessing and clausification
% 0.06/0.28  # Creating start rules for all 1 conjectures.
% 0.06/0.28  # There are 1 start rule candidates:
% 0.06/0.28  # Found 4 unit axioms.
% 0.06/0.28  # 1 start rule tableaux created.
% 0.06/0.28  # 2 extension rule candidate clauses
% 0.06/0.28  # 4 unit axiom clauses
% 0.06/0.28  
% 0.06/0.28  # Requested 8, 32 cores available to the main process.
% 0.06/0.28  # There are not enough tableaux to fork, creating more from the initial 1
% 0.06/0.28  # Creating equality axioms
% 0.06/0.28  # Ran out of tableaux, making start rules for all clauses
% 0.06/0.28  # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.06/0.28  # We now have 10 tableaux to operate on
% 0.06/0.28  # There were 1 total branch saturation attempts.
% 0.06/0.28  # There were 0 of these attempts blocked.
% 0.06/0.28  # There were 0 deferred branch saturation attempts.
% 0.06/0.28  # There were 0 free duplicated saturations.
% 0.06/0.28  # There were 1 total successful branch saturations.
% 0.06/0.28  # There were 0 successful branch saturations in interreduction.
% 0.06/0.28  # There were 0 successful branch saturations on the branch.
% 0.06/0.28  # There were 1 successful branch saturations after the branch.
% 0.06/0.28  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.28  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.28  # Begin clausification derivation
% 0.06/0.28  
% 0.06/0.28  # End clausification derivation
% 0.06/0.28  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.06/0.28  cnf(i_0_8, plain, (c_in(c_Tarski_OTop(v_cl,t_a),v_A,t_a))).
% 0.06/0.28  cnf(i_0_11, plain, (c_in(c_Tarski_Olub(v_Y,v_cl,t_a),v_A,t_a))).
% 0.06/0.28  cnf(i_0_10, plain, (c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a)=v_intY1)).
% 0.06/0.28  cnf(i_0_7, negated_conjecture, (~c_in(c_Tarski_Opotype_Opotype__ext(v_intY1,c_Tarski_Oinduced(v_intY1,v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)))).
% 0.06/0.28  cnf(i_0_12, plain, (c_Tarski_Ointerval(v_r,X1,c_Tarski_OTop(v_cl,t_a),t_a)!=c_emptyset|~c_in(X1,v_A,t_a))).
% 0.06/0.28  cnf(i_0_9, plain, (c_Tarski_Ointerval(v_r,X1,X2,t_a)=c_emptyset|c_in(c_Tarski_Opotype_Opotype__ext(c_Tarski_Ointerval(v_r,X1,X2,t_a),c_Tarski_Oinduced(c_Tarski_Ointerval(v_r,X1,X2,t_a),v_r,t_a),c_Product__Type_OUnity,t_a,tc_Product__Type_Ounit),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))|~c_in(X1,v_A,t_a)|~c_in(X2,v_A,t_a))).
% 0.06/0.28  cnf(i_0_20, plain, (X3=X3)).
% 0.06/0.28  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.06/0.28  # Begin printing tableau
% 0.06/0.28  # Found 7 steps
% 0.06/0.28  cnf(i_0_10, plain, (c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a)=v_intY1), inference(start_rule)).
% 0.06/0.28  cnf(i_0_33, plain, (c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a)=v_intY1), inference(extension_rule, [i_0_23])).
% 0.06/0.28  cnf(i_0_97, plain, (c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a)!=v_intY1), inference(closure_rule, [i_0_10])).
% 0.06/0.28  cnf(i_0_95, plain, (c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a)=c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a)), inference(extension_rule, [i_0_24])).
% 0.06/0.28  cnf(i_0_110, plain, (c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a)!=v_intY1), inference(closure_rule, [i_0_10])).
% 0.06/0.28  cnf(i_0_111, plain, (c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a)!=v_intY1), inference(closure_rule, [i_0_10])).
% 0.06/0.28  cnf(i_0_108, plain, (c_Tarski_Oinduced(c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a),c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a),c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a))=c_Tarski_Oinduced(c_Tarski_Ointerval(v_r,c_Tarski_Olub(v_Y,v_cl,t_a),c_Tarski_OTop(v_cl,t_a),t_a),v_intY1,v_intY1)), inference(etableau_closure_rule, [i_0_108, ...])).
% 0.06/0.28  # End printing tableau
% 0.06/0.28  # SZS output end
% 0.06/0.28  # Branches closed with saturation will be marked with an "s"
% 0.06/0.28  # Child (3111) has found a proof.
% 0.06/0.28  
% 0.06/0.28  # Proof search is over...
% 0.06/0.28  # Freeing feature tree
%------------------------------------------------------------------------------