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