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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LAT090-1 : TPTP v8.1.0. Released v2.6.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 : n013.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:53 EDT 2022

% Result   : Unsatisfiable 0.21s 0.39s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : LAT090-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jun 30 10:48:44 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.38  # No SInE strategy applied
% 0.21/0.38  # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.21/0.38  # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.21/0.38  #
% 0.21/0.38  # Number of axioms: 6 Number of unprocessed: 6
% 0.21/0.38  # Tableaux proof search.
% 0.21/0.38  # APR header successfully linked.
% 0.21/0.38  # Hello from C++
% 0.21/0.38  # The folding up rule is enabled...
% 0.21/0.38  # Local unification is enabled...
% 0.21/0.38  # Any saturation attempts will use folding labels...
% 0.21/0.38  # 6 beginning clauses after preprocessing and clausification
% 0.21/0.38  # Creating start rules for all 1 conjectures.
% 0.21/0.38  # There are 1 start rule candidates:
% 0.21/0.38  # Found 6 unit axioms.
% 0.21/0.38  # 1 start rule tableaux created.
% 0.21/0.38  # 0 extension rule candidate clauses
% 0.21/0.38  # 6 unit axiom clauses
% 0.21/0.38  
% 0.21/0.38  # Requested 8, 32 cores available to the main process.
% 0.21/0.38  # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.38  # Creating equality axioms
% 0.21/0.38  # Ran out of tableaux, making start rules for all clauses
% 0.21/0.38  # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.38  # We now have 9 tableaux to operate on
% 0.21/0.39  # There were 1 total branch saturation attempts.
% 0.21/0.39  # There were 0 of these attempts blocked.
% 0.21/0.39  # There were 0 deferred branch saturation attempts.
% 0.21/0.39  # There were 0 free duplicated saturations.
% 0.21/0.39  # There were 1 total successful branch saturations.
% 0.21/0.39  # There were 0 successful branch saturations in interreduction.
% 0.21/0.39  # There were 0 successful branch saturations on the branch.
% 0.21/0.39  # There were 1 successful branch saturations after the branch.
% 0.21/0.39  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39  # Begin clausification derivation
% 0.21/0.39  
% 0.21/0.39  # End clausification derivation
% 0.21/0.39  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39  cnf(i_0_12, negated_conjecture, (join(a,a)!=a)).
% 0.21/0.39  cnf(i_0_9, plain, (join(meet(X1,X2),meet(X2,join(X1,X2)))=X2)).
% 0.21/0.39  cnf(i_0_7, plain, (join(meet(X1,X2),meet(X1,join(X1,X2)))=X1)).
% 0.21/0.39  cnf(i_0_8, plain, (join(meet(X1,X1),meet(X2,join(X1,X1)))=X1)).
% 0.21/0.39  cnf(i_0_10, plain, (meet(meet(join(X1,X2),join(X3,X1)),X1)=X1)).
% 0.21/0.39  cnf(i_0_11, plain, (join(join(meet(X1,X2),meet(X3,X1)),X1)=X1)).
% 0.21/0.39  cnf(i_0_14, plain, (X4=X4)).
% 0.21/0.39  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.39  # Begin printing tableau
% 0.21/0.39  # Found 7 steps
% 0.21/0.39  cnf(i_0_12, negated_conjecture, (join(a,a)!=a), inference(start_rule)).
% 0.21/0.39  cnf(i_0_20, plain, (join(a,a)!=a), inference(extension_rule, [i_0_17])).
% 0.21/0.39  cnf(i_0_32, plain, (join(meet(X1,join(a,a)),meet(join(a,a),join(X1,join(a,a))))!=join(a,a)), inference(extension_rule, [i_0_16])).
% 0.21/0.39  cnf(i_0_43, plain, (join(meet(X1,join(a,a)),meet(join(a,a),join(X1,join(a,a))))!=join(a,a)), inference(closure_rule, [i_0_9])).
% 0.21/0.39  cnf(i_0_33, plain, (join(meet(X1,join(a,a)),meet(join(a,a),join(X1,join(a,a))))!=a), inference(extension_rule, [i_0_17])).
% 0.21/0.39  cnf(i_0_59, plain, (join(meet(X1,a),meet(a,join(X1,a)))!=a), inference(closure_rule, [i_0_9])).
% 0.21/0.39  cnf(i_0_58, plain, (join(meet(X1,join(a,a)),meet(join(a,a),join(X1,join(a,a))))!=join(meet(X1,a),meet(a,join(X1,a)))), inference(etableau_closure_rule, [i_0_58, ...])).
% 0.21/0.39  # End printing tableau
% 0.21/0.39  # SZS output end
% 0.21/0.39  # Branches closed with saturation will be marked with an "s"
% 0.21/0.39  # There were 1 total branch saturation attempts.
% 0.21/0.39  # There were 0 of these attempts blocked.
% 0.21/0.39  # There were 0 deferred branch saturation attempts.
% 0.21/0.39  # There were 0 free duplicated saturations.
% 0.21/0.39  # There were 1 total successful branch saturations.
% 0.21/0.39  # There were 0 successful branch saturations in interreduction.
% 0.21/0.39  # There were 0 successful branch saturations on the branch.
% 0.21/0.39  # There were 1 successful branch saturations after the branch.
% 0.21/0.39  # There were 1 total branch saturation attempts.
% 0.21/0.39  # There were 0 of these attempts blocked.
% 0.21/0.39  # There were 0 deferred branch saturation attempts.
% 0.21/0.39  # There were 0 free duplicated saturations.
% 0.21/0.39  # There were 1 total successful branch saturations.
% 0.21/0.39  # There were 0 successful branch saturations in interreduction.
% 0.21/0.39  # There were 0 successful branch saturations on the branch.
% 0.21/0.39  # There were 1 successful branch saturations after the branch.
% 0.21/0.39  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39  # Begin clausification derivation
% 0.21/0.39  
% 0.21/0.39  # End clausification derivation
% 0.21/0.39  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39  cnf(i_0_12, negated_conjecture, (join(a,a)!=a)).
% 0.21/0.39  cnf(i_0_9, plain, (join(meet(X1,X2),meet(X2,join(X1,X2)))=X2)).
% 0.21/0.39  cnf(i_0_7, plain, (join(meet(X1,X2),meet(X1,join(X1,X2)))=X1)).
% 0.21/0.39  cnf(i_0_8, plain, (join(meet(X1,X1),meet(X2,join(X1,X1)))=X1)).
% 0.21/0.39  cnf(i_0_10, plain, (meet(meet(join(X1,X2),join(X3,X1)),X1)=X1)).
% 0.21/0.39  cnf(i_0_11, plain, (join(join(meet(X1,X2),meet(X3,X1)),X1)=X1)).
% 0.21/0.39  cnf(i_0_14, plain, (X4=X4)).
% 0.21/0.39  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.39  # Begin printing tableau
% 0.21/0.39  # Found 6 steps
% 0.21/0.39  cnf(i_0_10, plain, (meet(meet(join(a,join(a,a)),join(X3,a)),a)=a), inference(start_rule)).
% 0.21/0.39  cnf(i_0_24, plain, (meet(meet(join(a,join(a,a)),join(X3,a)),a)=a), inference(extension_rule, [i_0_17])).
% 0.21/0.39  cnf(i_0_57, plain, (join(a,a)=a), inference(closure_rule, [i_0_12])).
% 0.21/0.39  cnf(i_0_58, plain, (join(a,a)!=meet(meet(join(a,join(a,a)),join(X3,a)),a)), inference(extension_rule, [i_0_17])).
% 0.21/0.39  cnf(i_0_71, plain, (join(a,a)!=join(meet(X1,join(a,a)),meet(join(a,a),join(X1,join(a,a))))), inference(closure_rule, [i_0_9])).
% 0.21/0.39  cnf(i_0_72, plain, (join(meet(X1,join(a,a)),meet(join(a,a),join(X1,join(a,a))))!=meet(meet(join(a,join(a,a)),join(X3,a)),a)), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.21/0.39  # End printing tableau
% 0.21/0.39  # SZS output end
% 0.21/0.39  # Branches closed with saturation will be marked with an "s"
% 0.21/0.39  # There were 1 total branch saturation attempts.
% 0.21/0.39  # There were 0 of these attempts blocked.
% 0.21/0.39  # There were 0 deferred branch saturation attempts.
% 0.21/0.39  # There were 0 free duplicated saturations.
% 0.21/0.39  # There were 1 total successful branch saturations.
% 0.21/0.39  # There were 0 successful branch saturations in interreduction.
% 0.21/0.39  # There were 0 successful branch saturations on the branch.
% 0.21/0.39  # There were 1 successful branch saturations after the branch.
% 0.21/0.39  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39  # Begin clausification derivation
% 0.21/0.39  
% 0.21/0.39  # End clausification derivation
% 0.21/0.39  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39  cnf(i_0_12, negated_conjecture, (join(a,a)!=a)).
% 0.21/0.39  cnf(i_0_9, plain, (join(meet(X1,X2),meet(X2,join(X1,X2)))=X2)).
% 0.21/0.39  cnf(i_0_7, plain, (join(meet(X1,X2),meet(X1,join(X1,X2)))=X1)).
% 0.21/0.39  cnf(i_0_8, plain, (join(meet(X1,X1),meet(X2,join(X1,X1)))=X1)).
% 0.21/0.39  cnf(i_0_10, plain, (meet(meet(join(X1,X2),join(X3,X1)),X1)=X1)).
% 0.21/0.39  cnf(i_0_11, plain, (join(join(meet(X1,X2),meet(X3,X1)),X1)=X1)).
% 0.21/0.39  cnf(i_0_14, plain, (X4=X4)).
% 0.21/0.39  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.39  # Begin printing tableau
% 0.21/0.39  # Found 6 steps
% 0.21/0.39  cnf(i_0_9, plain, (join(meet(X8,a),meet(a,join(X8,a)))=a), inference(start_rule)).
% 0.21/0.39  cnf(i_0_21, plain, (join(meet(X8,a),meet(a,join(X8,a)))=a), inference(extension_rule, [i_0_17])).
% 0.21/0.39  cnf(i_0_57, plain, (join(a,a)=a), inference(closure_rule, [i_0_12])).
% 0.21/0.39  cnf(i_0_58, plain, (join(a,a)!=join(meet(X8,a),meet(a,join(X8,a)))), inference(extension_rule, [i_0_17])).
% 0.21/0.39  cnf(i_0_143, plain, (join(a,a)!=join(meet(X1,join(a,a)),meet(join(a,a),join(X1,join(a,a))))), inference(closure_rule, [i_0_9])).
% 0.21/0.39  cnf(i_0_144, plain, (join(meet(X1,join(a,a)),meet(join(a,a),join(X1,join(a,a))))!=join(meet(X8,a),meet(a,join(X8,a)))), inference(etableau_closure_rule, [i_0_144, ...])).
% 0.21/0.39  # End printing tableau
% 0.21/0.39  # SZS output end
% 0.21/0.39  # Branches closed with saturation will be marked with an "s"
% 0.21/0.39  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39  # Begin clausification derivation
% 0.21/0.39  
% 0.21/0.39  # End clausification derivation
% 0.21/0.39  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39  cnf(i_0_12, negated_conjecture, (join(a,a)!=a)).
% 0.21/0.39  cnf(i_0_9, plain, (join(meet(X1,X2),meet(X2,join(X1,X2)))=X2)).
% 0.21/0.39  cnf(i_0_7, plain, (join(meet(X1,X2),meet(X1,join(X1,X2)))=X1)).
% 0.21/0.39  cnf(i_0_8, plain, (join(meet(X1,X1),meet(X2,join(X1,X1)))=X1)).
% 0.21/0.39  cnf(i_0_10, plain, (meet(meet(join(X1,X2),join(X3,X1)),X1)=X1)).
% 0.21/0.39  cnf(i_0_11, plain, (join(join(meet(X1,X2),meet(X3,X1)),X1)=X1)).
% 0.21/0.39  cnf(i_0_14, plain, (X4=X4)).
% 0.21/0.39  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.39  # Begin printing tableau
% 0.21/0.39  # Found 6 steps
% 0.21/0.39  cnf(i_0_7, plain, (join(meet(a,X8),meet(a,join(a,X8)))=a), inference(start_rule)).
% 0.21/0.39  cnf(i_0_22, plain, (join(meet(a,X8),meet(a,join(a,X8)))=a), inference(extension_rule, [i_0_17])).
% 0.21/0.39  cnf(i_0_57, plain, (join(a,a)=a), inference(closure_rule, [i_0_12])).
% 0.21/0.39  cnf(i_0_58, plain, (join(a,a)!=join(meet(a,X8),meet(a,join(a,X8)))), inference(extension_rule, [i_0_17])).
% 0.21/0.39  cnf(i_0_143, plain, (join(a,a)!=join(meet(X1,join(a,a)),meet(join(a,a),join(X1,join(a,a))))), inference(closure_rule, [i_0_9])).
% 0.21/0.39  cnf(i_0_144, plain, (join(meet(X1,join(a,a)),meet(join(a,a),join(X1,join(a,a))))!=join(meet(a,X8),meet(a,join(a,X8)))), inference(etableau_closure_rule, [i_0_144, ...])).
% 0.21/0.39  # End printing tableau
% 0.21/0.39  # SZS output end
% 0.21/0.39  # Branches closed with saturation will be marked with an "s"
% 0.21/0.39  # Child (25106) has found a proof.
% 0.21/0.39  
% 0.21/0.39  # Proof search is over...
% 0.21/0.39  # Freeing feature tree
%------------------------------------------------------------------------------