%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LAT022-1 : TPTP v8.1.0. Released v2.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 : n016.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:48:31 EDT 2022

% Result   : Unsatisfiable 46.11s 6.18s
% Output   : CNFRefutation 46.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LAT022-1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun 29 00:24:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.36  # No SInE strategy applied
% 0.18/0.36  # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.18/0.36  # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.18/0.36  #
% 0.18/0.36  # Number of axioms: 10 Number of unprocessed: 10
% 0.18/0.36  # Tableaux proof search.
% 0.18/0.36  # APR header successfully linked.
% 0.18/0.36  # Hello from C++
% 0.18/0.36  # The folding up rule is enabled...
% 0.18/0.36  # Local unification is enabled...
% 0.18/0.36  # Any saturation attempts will use folding labels...
% 0.18/0.36  # 10 beginning clauses after preprocessing and clausification
% 0.18/0.36  # Creating start rules for all 1 conjectures.
% 0.18/0.36  # There are 1 start rule candidates:
% 0.18/0.36  # Found 10 unit axioms.
% 0.18/0.36  # 1 start rule tableaux created.
% 0.18/0.36  # 0 extension rule candidate clauses
% 0.18/0.36  # 10 unit axiom clauses
% 0.18/0.36  
% 0.18/0.36  # Requested 8, 32 cores available to the main process.
% 0.18/0.36  # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.36  # Creating equality axioms
% 0.18/0.36  # Ran out of tableaux, making start rules for all clauses
% 0.18/0.36  # Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36  # We now have 15 tableaux to operate on
% 46.11/6.18  # There were 1 total branch saturation attempts.
% 46.11/6.18  # There were 0 of these attempts blocked.
% 46.11/6.18  # There were 0 deferred branch saturation attempts.
% 46.11/6.18  # There were 0 free duplicated saturations.
% 46.11/6.18  # There were 1 total successful branch saturations.
% 46.11/6.18  # There were 0 successful branch saturations in interreduction.
% 46.11/6.18  # There were 0 successful branch saturations on the branch.
% 46.11/6.18  # There were 1 successful branch saturations after the branch.
% 46.11/6.18  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 46.11/6.18  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 46.11/6.18  # Begin clausification derivation
% 46.11/6.18  
% 46.11/6.18  # End clausification derivation
% 46.11/6.18  # Begin listing active clauses obtained from FOF to CNF conversion
% 46.11/6.18  cnf(i_0_11, plain, (meet(X1,X1)=X1)).
% 46.11/6.18  cnf(i_0_12, plain, (join(X1,X1)=X1)).
% 46.11/6.18  cnf(i_0_13, plain, (meet(X1,X2)=meet(X2,X1))).
% 46.11/6.18  cnf(i_0_14, plain, (join(X1,X2)=join(X2,X1))).
% 46.11/6.18  cnf(i_0_15, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))).
% 46.11/6.18  cnf(i_0_16, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 46.11/6.18  cnf(i_0_18, plain, (meet(join(X1,meet(X2,X3)),join(X1,X2))=join(X1,meet(X2,X3)))).
% 46.11/6.18  cnf(i_0_17, plain, (join(meet(X1,join(X2,X3)),meet(X1,X2))=meet(X1,join(X2,X3)))).
% 46.11/6.18  cnf(i_0_20, negated_conjecture, (join(meet(a,b),meet(a,c))!=meet(a,join(b,meet(a,c))))).
% 46.11/6.18  cnf(i_0_19, hypothesis, (join(meet(X1,X2),meet(X3,join(X1,X2)))=meet(join(X1,X2),join(X3,meet(X1,X2))))).
% 46.11/6.18  cnf(i_0_22, plain, (X4=X4)).
% 46.11/6.18  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 46.11/6.18  # Begin printing tableau
% 46.11/6.18  # Found 6 steps
% 46.11/6.18  cnf(i_0_11, plain, (meet(X7,X7)=X7), inference(start_rule)).
% 46.11/6.18  cnf(i_0_28, plain, (meet(X7,X7)=X7), inference(extension_rule, [i_0_26])).
% 46.11/6.18  cnf(i_0_48, plain, (meet(X7,X7)!=X7), inference(closure_rule, [i_0_11])).
% 46.11/6.18  cnf(i_0_46, plain, (meet(meet(X7,X7),meet(X7,X7))=meet(X7,X7)), inference(extension_rule, [i_0_25])).
% 46.11/6.18  cnf(i_0_58, plain, (meet(X7,X7)!=X7), inference(closure_rule, [i_0_11])).
% 46.11/6.18  cnf(i_0_56, plain, (meet(meet(X7,X7),meet(X7,X7))=X7), inference(etableau_closure_rule, [i_0_56, ...])).
% 46.11/6.18  # End printing tableau
% 46.11/6.18  # SZS output end
% 46.11/6.18  # Branches closed with saturation will be marked with an "s"
% 46.59/6.20  # Child (32596) has found a proof.
% 46.59/6.20  
% 46.59/6.20  # Proof search is over...
% 46.59/6.20  # Freeing feature tree
%------------------------------------------------------------------------------