↑ Up

Etableau---0.67.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN585-1 : TPTP v8.1.0. Released v2.5.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 : n018.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 : Thu Jul 21 06:12:38 EDT 2022

% Result   : Unsatisfiable 73.36s 9.58s
% Output   : CNFRefutation 73.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN585-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.33  % Computer : n018.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon Jul 11 17:19:29 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.36  # No SInE strategy applied
% 0.11/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.36  #
% 0.11/0.36  # Presaturation interreduction done
% 0.11/0.36  # Number of axioms: 26 Number of unprocessed: 26
% 0.11/0.36  # Tableaux proof search.
% 0.11/0.36  # APR header successfully linked.
% 0.11/0.36  # Hello from C++
% 0.11/0.36  # The folding up rule is enabled...
% 0.11/0.36  # Local unification is enabled...
% 0.11/0.36  # Any saturation attempts will use folding labels...
% 0.11/0.36  # 26 beginning clauses after preprocessing and clausification
% 0.11/0.36  # Creating start rules for all 26 conjectures.
% 0.11/0.36  # There are 26 start rule candidates:
% 0.11/0.36  # Found 12 unit axioms.
% 0.11/0.36  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.36  # 26 start rule tableaux created.
% 0.11/0.36  # 14 extension rule candidate clauses
% 0.11/0.36  # 12 unit axiom clauses
% 0.11/0.36  
% 0.11/0.36  # Requested 8, 32 cores available to the main process.
% 73.36/9.58  # There were 8 total branch saturation attempts.
% 73.36/9.58  # There were 0 of these attempts blocked.
% 73.36/9.58  # There were 0 deferred branch saturation attempts.
% 73.36/9.58  # There were 0 free duplicated saturations.
% 73.36/9.58  # There were 1 total successful branch saturations.
% 73.36/9.58  # There were 0 successful branch saturations in interreduction.
% 73.36/9.58  # There were 0 successful branch saturations on the branch.
% 73.36/9.58  # There were 1 successful branch saturations after the branch.
% 73.36/9.58  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 73.36/9.58  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 73.36/9.58  # Begin clausification derivation
% 73.36/9.58  
% 73.36/9.58  # End clausification derivation
% 73.36/9.58  # Begin listing active clauses obtained from FOF to CNF conversion
% 73.36/9.58  cnf(i_0_29, negated_conjecture, (p10(c14,c15))).
% 73.36/9.58  cnf(i_0_30, negated_conjecture, (p10(c17,c14))).
% 73.36/9.58  cnf(i_0_27, negated_conjecture, (p2(X1,X1))).
% 73.36/9.58  cnf(i_0_28, negated_conjecture, (p11(X1,X1))).
% 73.36/9.58  cnf(i_0_33, negated_conjecture, (p11(c18,f9(c12,c14)))).
% 73.36/9.58  cnf(i_0_34, negated_conjecture, (p2(f6(c15,c14),c17))).
% 73.36/9.58  cnf(i_0_35, negated_conjecture, (p2(f5(c15,c14),c16))).
% 73.36/9.58  cnf(i_0_37, negated_conjecture, (p2(f7(f8(c16,c14),c17),c15))).
% 73.36/9.58  cnf(i_0_31, negated_conjecture, (~p2(c14,f3(c13)))).
% 73.36/9.58  cnf(i_0_32, negated_conjecture, (~p2(c12,f3(c13)))).
% 73.36/9.58  cnf(i_0_36, negated_conjecture, (~p2(c12,f3(f4(c13))))).
% 73.36/9.58  cnf(i_0_38, negated_conjecture, (~p11(c18,f9(c12,f8(c16,c14))))).
% 73.36/9.58  cnf(i_0_43, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 73.36/9.58  cnf(i_0_42, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X1,X3))).
% 73.36/9.58  cnf(i_0_39, negated_conjecture, (p11(X1,f8(X2,X3))|~p11(X1,X3))).
% 73.36/9.58  cnf(i_0_41, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))).
% 73.36/9.58  cnf(i_0_40, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))).
% 73.36/9.58  cnf(i_0_52, negated_conjecture, (p11(f9(X1,X2),f9(X1,X3))|p2(X1,f3(c13))|~p11(X2,X3))).
% 73.36/9.58  cnf(i_0_45, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 73.36/9.58  cnf(i_0_44, negated_conjecture, (p10(X1,X2)|~p10(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 73.36/9.58  cnf(i_0_51, negated_conjecture, (p11(X1,X2)|p2(X3,f3(c13))|~p11(f9(X3,X1),f9(X3,X2)))).
% 73.36/9.58  cnf(i_0_46, negated_conjecture, (p2(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 73.36/9.58  cnf(i_0_48, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 73.36/9.58  cnf(i_0_47, negated_conjecture, (p2(f5(X1,X2),f5(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 73.36/9.58  cnf(i_0_50, negated_conjecture, (p2(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 73.36/9.58  cnf(i_0_49, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 73.36/9.58  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 73.36/9.58  # Begin printing tableau
% 73.36/9.58  # Found 6 steps
% 73.36/9.58  cnf(i_0_38, negated_conjecture, (~p11(c18,f9(c12,f8(c16,c14)))), inference(start_rule)).
% 73.36/9.58  cnf(i_0_94, plain, (~p11(c18,f9(c12,f8(c16,c14)))), inference(extension_rule, [i_0_42])).
% 73.36/9.58  cnf(i_0_547771, plain, (~p11(c18,f9(c12,c14))), inference(closure_rule, [i_0_33])).
% 73.36/9.58  cnf(i_0_547770, plain, (~p11(f9(c12,c14),f9(c12,f8(c16,c14)))), inference(extension_rule, [i_0_52])).
% 73.36/9.58  cnf(i_0_547795, plain, (p2(c12,f3(c13))), inference(closure_rule, [i_0_32])).
% 73.36/9.58  cnf(i_0_547796, plain, (~p11(c14,f8(c16,c14))), inference(etableau_closure_rule, [i_0_547796, ...])).
% 73.36/9.58  # End printing tableau
% 73.36/9.58  # SZS output end
% 73.36/9.58  # Branches closed with saturation will be marked with an "s"
% 73.51/9.59  # Child (15804) has found a proof.
% 73.51/9.59  
% 73.51/9.59  # Proof search is over...
% 73.51/9.59  # Freeing feature tree
%------------------------------------------------------------------------------