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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LAT029-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 : n028.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:34 EDT 2022

% Result   : Unsatisfiable 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LAT029-1 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33  % Computer : n028.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jun 29 22:04:58 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.36  # No SInE strategy applied
% 0.13/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36  #
% 0.13/0.36  # Presaturation interreduction done
% 0.13/0.36  # Number of axioms: 6 Number of unprocessed: 6
% 0.13/0.36  # Tableaux proof search.
% 0.13/0.36  # APR header successfully linked.
% 0.13/0.36  # Hello from C++
% 0.13/0.36  # The folding up rule is enabled...
% 0.13/0.36  # Local unification is enabled...
% 0.13/0.36  # Any saturation attempts will use folding labels...
% 0.13/0.36  # 6 beginning clauses after preprocessing and clausification
% 0.13/0.36  # Creating start rules for all 1 conjectures.
% 0.13/0.36  # There are 1 start rule candidates:
% 0.13/0.36  # Found 5 unit axioms.
% 0.13/0.36  # 1 start rule tableaux created.
% 0.13/0.36  # 1 extension rule candidate clauses
% 0.13/0.36  # 5 unit axiom clauses
% 0.13/0.36  
% 0.13/0.36  # Requested 8, 32 cores available to the main process.
% 0.13/0.36  # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.36  # Creating equality axioms
% 0.13/0.36  # Ran out of tableaux, making start rules for all clauses
% 0.13/0.36  # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.36  # We now have 11 tableaux to operate on
% 0.13/0.38  # There were 1 total branch saturation attempts.
% 0.13/0.38  # There were 0 of these attempts blocked.
% 0.13/0.38  # There were 0 deferred branch saturation attempts.
% 0.13/0.38  # There were 0 free duplicated saturations.
% 0.13/0.38  # There were 1 total successful branch saturations.
% 0.13/0.38  # There were 0 successful branch saturations in interreduction.
% 0.13/0.38  # There were 0 successful branch saturations on the branch.
% 0.13/0.38  # There were 1 successful branch saturations after the branch.
% 0.13/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38  # Begin clausification derivation
% 0.13/0.38  
% 0.13/0.38  # End clausification derivation
% 0.13/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38  cnf(i_0_9, plain, (join(meet(X1,X2),meet(X2,join(X1,X2)))=X2)).
% 0.13/0.38  cnf(i_0_7, plain, (join(meet(X1,X2),meet(X1,join(X1,X2)))=X1)).
% 0.13/0.38  cnf(i_0_8, plain, (join(meet(X1,X1),meet(X2,join(X1,X1)))=X1)).
% 0.13/0.38  cnf(i_0_10, plain, (meet(meet(join(X1,X2),join(X3,X1)),X1)=X1)).
% 0.13/0.38  cnf(i_0_11, plain, (join(join(meet(X1,X2),meet(X3,X1)),X1)=X1)).
% 0.13/0.38  cnf(i_0_12, negated_conjecture, (meet(b,a)!=meet(a,b)|join(b,a)!=join(a,b)|meet(a,a)!=a|join(a,a)!=a)).
% 0.13/0.38  cnf(i_0_33, plain, (X4=X4)).
% 0.13/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.38  # Begin printing tableau
% 0.13/0.38  # Found 6 steps
% 0.13/0.38  cnf(i_0_10, plain, (meet(meet(join(X4,X6),join(X3,X4)),X4)=X4), inference(start_rule)).
% 0.13/0.38  cnf(i_0_42, plain, (meet(meet(join(X4,X6),join(X3,X4)),X4)=X4), inference(extension_rule, [i_0_36])).
% 0.13/0.38  cnf(i_0_75, plain, (join(meet(meet(meet(join(X4,X6),join(X3,X4)),X4),X6),meet(meet(meet(join(X4,X6),join(X3,X4)),X4),join(meet(meet(join(X4,X6),join(X3,X4)),X4),X6)))!=meet(meet(join(X4,X6),join(X3,X4)),X4)), inference(closure_rule, [i_0_7])).
% 0.13/0.38  cnf(i_0_74, plain, (join(meet(meet(meet(join(X4,X6),join(X3,X4)),X4),X6),meet(meet(meet(join(X4,X6),join(X3,X4)),X4),join(meet(meet(join(X4,X6),join(X3,X4)),X4),X6)))=X4), inference(extension_rule, [i_0_37])).
% 0.13/0.38  cnf(i_0_87, plain, (join(meet(X1,X6),meet(X6,join(X1,X6)))!=X6), inference(closure_rule, [i_0_9])).
% 0.13/0.38  cnf(i_0_85, plain, (meet(join(meet(meet(meet(join(X4,X6),join(X3,X4)),X4),X6),meet(meet(meet(join(X4,X6),join(X3,X4)),X4),join(meet(meet(join(X4,X6),join(X3,X4)),X4),X6))),join(meet(X1,X6),meet(X6,join(X1,X6))))=meet(X4,X6)), inference(etableau_closure_rule, [i_0_85, ...])).
% 0.13/0.38  # End printing tableau
% 0.13/0.38  # SZS output end
% 0.13/0.38  # Branches closed with saturation will be marked with an "s"
% 0.13/0.38  # There were 1 total branch saturation attempts.
% 0.13/0.38  # There were 0 of these attempts blocked.
% 0.13/0.38  # There were 0 deferred branch saturation attempts.
% 0.13/0.38  # There were 0 free duplicated saturations.
% 0.13/0.38  # There were 1 total successful branch saturations.
% 0.13/0.38  # There were 0 successful branch saturations in interreduction.
% 0.13/0.38  # There were 0 successful branch saturations on the branch.
% 0.13/0.38  # There were 1 successful branch saturations after the branch.
% 0.13/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38  # Begin clausification derivation
% 0.13/0.38  
% 0.13/0.38  # End clausification derivation
% 0.13/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38  cnf(i_0_9, plain, (join(meet(X1,X2),meet(X2,join(X1,X2)))=X2)).
% 0.13/0.38  cnf(i_0_7, plain, (join(meet(X1,X2),meet(X1,join(X1,X2)))=X1)).
% 0.13/0.38  cnf(i_0_8, plain, (join(meet(X1,X1),meet(X2,join(X1,X1)))=X1)).
% 0.13/0.38  cnf(i_0_10, plain, (meet(meet(join(X1,X2),join(X3,X1)),X1)=X1)).
% 0.13/0.38  cnf(i_0_11, plain, (join(join(meet(X1,X2),meet(X3,X1)),X1)=X1)).
% 0.13/0.38  cnf(i_0_12, negated_conjecture, (meet(b,a)!=meet(a,b)|join(b,a)!=join(a,b)|meet(a,a)!=a|join(a,a)!=a)).
% 0.13/0.38  cnf(i_0_33, plain, (X4=X4)).
% 0.13/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.38  # Begin printing tableau
% 0.13/0.38  # Found 6 steps
% 0.13/0.38  cnf(i_0_9, plain, (join(meet(X13,X6),meet(X6,join(X13,X6)))=X6), inference(start_rule)).
% 0.13/0.38  cnf(i_0_39, plain, (join(meet(X13,X6),meet(X6,join(X13,X6)))=X6), inference(extension_rule, [i_0_37])).
% 0.13/0.38  cnf(i_0_61, plain, (join(meet(X1,X4),meet(X4,join(X1,X4)))!=X4), inference(closure_rule, [i_0_9])).
% 0.13/0.38  cnf(i_0_60, plain, (meet(join(meet(X1,X4),meet(X4,join(X1,X4))),join(meet(X13,X6),meet(X6,join(X13,X6))))=meet(X4,X6)), inference(extension_rule, [i_0_36])).
% 0.13/0.38  cnf(i_0_76, plain, (meet(X4,X6)!=join(meet(X1,meet(X4,X6)),meet(meet(X4,X6),join(X1,meet(X4,X6))))), inference(closure_rule, [i_0_9])).
% 0.13/0.38  cnf(i_0_74, plain, (meet(join(meet(X1,X4),meet(X4,join(X1,X4))),join(meet(X13,X6),meet(X6,join(X13,X6))))=join(meet(X1,meet(X4,X6)),meet(meet(X4,X6),join(X1,meet(X4,X6))))), inference(etableau_closure_rule, [i_0_74, ...])).
% 0.13/0.38  # End printing tableau
% 0.13/0.38  # SZS output end
% 0.13/0.38  # Branches closed with saturation will be marked with an "s"
% 0.13/0.38  # There were 1 total branch saturation attempts.
% 0.13/0.38  # There were 0 of these attempts blocked.
% 0.13/0.38  # There were 0 deferred branch saturation attempts.
% 0.13/0.38  # There were 0 free duplicated saturations.
% 0.13/0.38  # There were 1 total successful branch saturations.
% 0.13/0.38  # There were 0 successful branch saturations in interreduction.
% 0.13/0.38  # There were 0 successful branch saturations on the branch.
% 0.13/0.38  # There were 1 successful branch saturations after the branch.
% 0.13/0.38  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38  # Begin clausification derivation
% 0.13/0.38  
% 0.13/0.38  # End clausification derivation
% 0.13/0.38  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38  cnf(i_0_9, plain, (join(meet(X1,X2),meet(X2,join(X1,X2)))=X2)).
% 0.13/0.38  cnf(i_0_7, plain, (join(meet(X1,X2),meet(X1,join(X1,X2)))=X1)).
% 0.13/0.38  cnf(i_0_8, plain, (join(meet(X1,X1),meet(X2,join(X1,X1)))=X1)).
% 0.13/0.38  cnf(i_0_10, plain, (meet(meet(join(X1,X2),join(X3,X1)),X1)=X1)).
% 0.13/0.38  cnf(i_0_11, plain, (join(join(meet(X1,X2),meet(X3,X1)),X1)=X1)).
% 0.13/0.38  cnf(i_0_12, negated_conjecture, (meet(b,a)!=meet(a,b)|join(b,a)!=join(a,b)|meet(a,a)!=a|join(a,a)!=a)).
% 0.13/0.38  cnf(i_0_33, plain, (X4=X4)).
% 0.13/0.38  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.13/0.38  # Begin printing tableau
% 0.13/0.38  # Found 6 steps
% 0.13/0.38  cnf(i_0_9, plain, (join(meet(X11,X4),meet(X4,join(X11,X4)))=X4), inference(start_rule)).
% 0.13/0.38  cnf(i_0_39, plain, (join(meet(X11,X4),meet(X4,join(X11,X4)))=X4), inference(extension_rule, [i_0_37])).
% 0.13/0.38  cnf(i_0_62, plain, (join(meet(X1,X6),meet(X6,join(X1,X6)))!=X6), inference(closure_rule, [i_0_9])).
% 0.13/0.38  cnf(i_0_60, plain, (meet(join(meet(X11,X4),meet(X4,join(X11,X4))),join(meet(X1,X6),meet(X6,join(X1,X6))))=meet(X4,X6)), inference(extension_rule, [i_0_36])).
% 0.13/0.38  cnf(i_0_76, plain, (meet(X4,X6)!=join(meet(X1,meet(X4,X6)),meet(meet(X4,X6),join(X1,meet(X4,X6))))), inference(closure_rule, [i_0_9])).
% 0.13/0.38  cnf(i_0_74, plain, (meet(join(meet(X11,X4),meet(X4,join(X11,X4))),join(meet(X1,X6),meet(X6,join(X1,X6))))=join(meet(X1,meet(X4,X6)),meet(meet(X4,X6),join(X1,meet(X4,X6))))), inference(etableau_closure_rule, [i_0_74, ...])).
% 0.13/0.38  # End printing tableau
% 0.13/0.38  # SZS output end
% 0.13/0.38  # Branches closed with saturation will be marked with an "s"
% 0.13/0.38  # Child (27788) has found a proof.
% 0.13/0.38  
% 0.13/0.38  # Proof search is over...
% 0.13/0.38  # Freeing feature tree
%------------------------------------------------------------------------------