TSTP Solution File: SYN014-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN014-1 : TPTP v8.1.0. Released v1.0.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 : n027.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:07:16 EDT 2022

% Result   : Unsatisfiable 0.14s 0.40s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem  : SYN014-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14  % 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 : n027.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 : Mon Jul 11 15:43:04 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.39  # No SInE strategy applied
% 0.14/0.39  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39  #
% 0.14/0.39  # Presaturation interreduction done
% 0.14/0.39  # Number of axioms: 17 Number of unprocessed: 17
% 0.14/0.39  # Tableaux proof search.
% 0.14/0.39  # APR header successfully linked.
% 0.14/0.39  # Hello from C++
% 0.14/0.39  # The folding up rule is enabled...
% 0.14/0.39  # Local unification is enabled...
% 0.14/0.39  # Any saturation attempts will use folding labels...
% 0.14/0.39  # 17 beginning clauses after preprocessing and clausification
% 0.14/0.39  # Creating start rules for all 17 conjectures.
% 0.14/0.39  # There are 17 start rule candidates:
% 0.14/0.39  # Found 1 unit axioms.
% 0.14/0.39  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.39  # 17 start rule tableaux created.
% 0.14/0.39  # 16 extension rule candidate clauses
% 0.14/0.39  # 1 unit axiom clauses
% 0.14/0.39  
% 0.14/0.39  # Requested 8, 32 cores available to the main process.
% 0.14/0.40  # Creating equality axioms
% 0.14/0.40  # Ran out of tableaux, making start rules for all clauses
% 0.14/0.40  # Creating equality axioms
% 0.14/0.40  # Ran out of tableaux, making start rules for all clauses
% 0.14/0.40  # There were 2 total branch saturation attempts.
% 0.14/0.40  # There were 0 of these attempts blocked.
% 0.14/0.40  # There were 0 deferred branch saturation attempts.
% 0.14/0.40  # There were 0 free duplicated saturations.
% 0.14/0.40  # There were 2 total successful branch saturations.
% 0.14/0.40  # There were 0 successful branch saturations in interreduction.
% 0.14/0.40  # There were 0 successful branch saturations on the branch.
% 0.14/0.40  # There were 2 successful branch saturations after the branch.
% 0.14/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40  # Begin clausification derivation
% 0.14/0.40  
% 0.14/0.40  # End clausification derivation
% 0.14/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.40  cnf(i_0_18, negated_conjecture, (n!=m)).
% 0.14/0.40  cnf(i_0_19, negated_conjecture, (k=n|k=m)).
% 0.14/0.40  cnf(i_0_22, negated_conjecture, (X1=m|f(X1)!=m|~element(X1,m))).
% 0.14/0.40  cnf(i_0_21, negated_conjecture, (X1=j|X1=k|~element(X1,j))).
% 0.14/0.40  cnf(i_0_27, negated_conjecture, (X1=n|element(X1,n)|g(X1)!=n)).
% 0.14/0.40  cnf(i_0_32, negated_conjecture, (k=m|element(m,k))).
% 0.14/0.40  cnf(i_0_23, negated_conjecture, (X1=m|f(X1)!=X1|~element(X1,m))).
% 0.14/0.40  cnf(i_0_28, negated_conjecture, (X1=n|element(X1,n)|g(X1)!=X1)).
% 0.14/0.40  cnf(i_0_33, negated_conjecture, (k=n|element(n,k))).
% 0.14/0.40  cnf(i_0_20, negated_conjecture, (j=k|element(k,j))).
% 0.14/0.40  cnf(i_0_34, negated_conjecture, (X1=k|X1=n|X1=m|~element(X1,k))).
% 0.14/0.40  cnf(i_0_24, negated_conjecture, (X1=m|element(X1,f(X1))|~element(X1,m))).
% 0.14/0.40  cnf(i_0_25, negated_conjecture, (X1=m|element(f(X1),X1)|~element(X1,m))).
% 0.14/0.40  cnf(i_0_29, negated_conjecture, (X1=n|element(X1,g(X1))|element(X1,n))).
% 0.14/0.40  cnf(i_0_30, negated_conjecture, (X1=n|element(g(X1),X1)|element(X1,n))).
% 0.14/0.40  cnf(i_0_31, negated_conjecture, (X1=n|X2=n|X1=X2|~element(X1,n)|~element(X2,X1)|~element(X1,X2))).
% 0.14/0.40  cnf(i_0_26, negated_conjecture, (X1=m|X2=m|X1=X2|element(X1,m)|~element(X2,X1)|~element(X1,X2))).
% 0.14/0.40  cnf(i_0_192, plain, (X3=X3)).
% 0.14/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.14/0.40  # Begin printing tableau
% 0.14/0.40  # Found 7 steps
% 0.14/0.40  cnf(i_0_192, plain, (n=n), inference(start_rule)).
% 0.14/0.40  cnf(i_0_251, plain, (n=n), inference(extension_rule, [i_0_196])).
% 0.14/0.40  cnf(i_0_312, plain, ($false), inference(closure_rule, [i_0_192])).
% 0.14/0.40  cnf(i_0_310, plain, (element(n,m)), inference(extension_rule, [i_0_25])).
% 0.14/0.40  cnf(i_0_332, plain, (n=m), inference(closure_rule, [i_0_18])).
% 0.14/0.40  cnf(i_0_313, plain, (~element(n,m)), inference(etableau_closure_rule, [i_0_313, ...])).
% 0.14/0.40  cnf(i_0_333, plain, (element(f(n),n)), inference(etableau_closure_rule, [i_0_333, ...])).
% 0.14/0.40  # End printing tableau
% 0.14/0.40  # SZS output end
% 0.14/0.40  # Branches closed with saturation will be marked with an "s"
% 0.14/0.40  # Child (689) has found a proof.
% 0.14/0.40  # There were 2 total branch saturation attempts.
% 0.14/0.40  # There were 0 of these attempts blocked.
% 0.14/0.40  # There were 0 deferred branch saturation attempts.
% 0.14/0.40  # There were 0 free duplicated saturations.
% 0.14/0.40  # There were 2 total successful branch saturations.
% 0.14/0.40  # There were 0 successful branch saturations in interreduction.
% 0.14/0.40  # There were 0 successful branch saturations on the branch.
% 0.14/0.40  # There were 2 successful branch saturations after the branch.
% 0.14/0.40  
% 0.14/0.40  # Proof search is over...
% 0.14/0.40  # Freeing feature tree
%------------------------------------------------------------------------------