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