TSTP Solution File: LAT085-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT085-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 : n019.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:51 EDT 2022
% Result : Unsatisfiable 3.45s 2.32s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT085-1 : TPTP v8.1.0. Released v2.6.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.33 % Computer : n019.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 : Tue Jun 28 21:53:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Number of axioms: 2 Number of unprocessed: 2
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.76/1.00 # The folding up rule is enabled...
% 0.76/1.00 # Local unification is enabled...
% 0.76/1.00 # Any saturation attempts will use folding labels...
% 0.76/1.00 # 2 beginning clauses after preprocessing and clausification
% 0.76/1.00 # Creating start rules for all 1 conjectures.
% 0.76/1.00 # There are 1 start rule candidates:
% 0.76/1.00 # Found 2 unit axioms.
% 0.76/1.00 # 1 start rule tableaux created.
% 0.76/1.00 # 0 extension rule candidate clauses
% 0.76/1.00 # 2 unit axiom clauses
% 0.76/1.00
% 0.76/1.00 # Requested 8, 32 cores available to the main process.
% 0.76/1.00 # There are not enough tableaux to fork, creating more from the initial 1
% 0.76/1.00 # Creating equality axioms
% 0.76/1.00 # Ran out of tableaux, making start rules for all clauses
% 1.37/1.60 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 1.37/1.60 # We now have 9 tableaux to operate on
% 3.45/2.32 # There were 3 total branch saturation attempts.
% 3.45/2.32 # There were 0 of these attempts blocked.
% 3.45/2.32 # There were 0 deferred branch saturation attempts.
% 3.45/2.32 # There were 0 free duplicated saturations.
% 3.45/2.32 # There were 3 total successful branch saturations.
% 3.45/2.32 # There were 0 successful branch saturations in interreduction.
% 3.45/2.32 # There were 0 successful branch saturations on the branch.
% 3.45/2.32 # There were 3 successful branch saturations after the branch.
% 3.45/2.32 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.45/2.32 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.45/2.32 # Begin clausification derivation
% 3.45/2.32
% 3.45/2.32 # End clausification derivation
% 3.45/2.32 # Begin listing active clauses obtained from FOF to CNF conversion
% 3.45/2.32 cnf(i_0_4, negated_conjecture, (join(join(a,b),c)!=join(a,join(b,c)))).
% 3.45/2.32 cnf(i_0_3, plain, (join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)),meet(join(meet(X2,meet(meet(join(X4,join(X2,X5)),join(X6,X2)),X2)),meet(X7,join(X2,meet(meet(join(X4,join(X2,X5)),join(X6,X2)),X2)))),join(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3)))=X2)).
% 3.45/2.32 cnf(i_0_6, plain, (X8=X8)).
% 3.45/2.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 3.45/2.32 # Begin printing tableau
% 3.45/2.32 # Found 6 steps
% 3.45/2.32 cnf(i_0_3, plain, (join(meet(join(meet(X18,join(a,join(b,c))),meet(join(a,join(b,c)),join(X18,join(a,join(b,c))))),X17),meet(join(meet(X18,join(join(meet(X16,join(a,join(b,c))),meet(join(a,join(b,c)),X15)),join(a,join(b,c)))),meet(join(meet(join(a,join(b,c)),meet(meet(join(X16,join(join(a,join(b,c)),X15)),join(X14,join(a,join(b,c)))),join(a,join(b,c)))),meet(X13,join(join(a,join(b,c)),meet(meet(join(X16,join(join(a,join(b,c)),X15)),join(X14,join(a,join(b,c)))),join(a,join(b,c)))))),join(X18,join(join(meet(X16,join(a,join(b,c))),meet(join(a,join(b,c)),X15)),join(a,join(b,c)))))),join(join(meet(X18,join(a,join(b,c))),meet(join(a,join(b,c)),join(X18,join(a,join(b,c))))),X17)))=join(a,join(b,c))), inference(start_rule)).
% 3.45/2.32 cnf(i_0_13, plain, (join(meet(join(meet(X18,join(a,join(b,c))),meet(join(a,join(b,c)),join(X18,join(a,join(b,c))))),X17),meet(join(meet(X18,join(join(meet(X16,join(a,join(b,c))),meet(join(a,join(b,c)),X15)),join(a,join(b,c)))),meet(join(meet(join(a,join(b,c)),meet(meet(join(X16,join(join(a,join(b,c)),X15)),join(X14,join(a,join(b,c)))),join(a,join(b,c)))),meet(X13,join(join(a,join(b,c)),meet(meet(join(X16,join(join(a,join(b,c)),X15)),join(X14,join(a,join(b,c)))),join(a,join(b,c)))))),join(X18,join(join(meet(X16,join(a,join(b,c))),meet(join(a,join(b,c)),X15)),join(a,join(b,c)))))),join(join(meet(X18,join(a,join(b,c))),meet(join(a,join(b,c)),join(X18,join(a,join(b,c))))),X17)))=join(a,join(b,c))), inference(extension_rule, [i_0_9])).
% 3.45/2.32 cnf(i_0_383953, plain, (join(join(a,b),c)=join(a,join(b,c))), inference(closure_rule, [i_0_4])).
% 3.45/2.32 cnf(i_0_383954, plain, (join(join(a,b),c)!=join(meet(join(meet(X18,join(a,join(b,c))),meet(join(a,join(b,c)),join(X18,join(a,join(b,c))))),X17),meet(join(meet(X18,join(join(meet(X16,join(a,join(b,c))),meet(join(a,join(b,c)),X15)),join(a,join(b,c)))),meet(join(meet(join(a,join(b,c)),meet(meet(join(X16,join(join(a,join(b,c)),X15)),join(X14,join(a,join(b,c)))),join(a,join(b,c)))),meet(X13,join(join(a,join(b,c)),meet(meet(join(X16,join(join(a,join(b,c)),X15)),join(X14,join(a,join(b,c)))),join(a,join(b,c)))))),join(X18,join(join(meet(X16,join(a,join(b,c))),meet(join(a,join(b,c)),X15)),join(a,join(b,c)))))),join(join(meet(X18,join(a,join(b,c))),meet(join(a,join(b,c)),join(X18,join(a,join(b,c))))),X17)))), inference(extension_rule, [i_0_9])).
% 3.45/2.32 cnf(i_0_384039, plain, (join(join(a,b),c)!=join(meet(join(meet(X1,join(join(a,b),c)),meet(join(join(a,b),c),join(X1,join(join(a,b),c)))),X3),meet(join(meet(X1,join(join(meet(X4,join(join(a,b),c)),meet(join(join(a,b),c),X5)),join(join(a,b),c))),meet(join(meet(join(join(a,b),c),meet(meet(join(X4,join(join(join(a,b),c),X5)),join(X6,join(join(a,b),c))),join(join(a,b),c))),meet(X7,join(join(join(a,b),c),meet(meet(join(X4,join(join(join(a,b),c),X5)),join(X6,join(join(a,b),c))),join(join(a,b),c))))),join(X1,join(join(meet(X4,join(join(a,b),c)),meet(join(join(a,b),c),X5)),join(join(a,b),c))))),join(join(meet(X1,join(join(a,b),c)),meet(join(join(a,b),c),join(X1,join(join(a,b),c)))),X3)))), inference(closure_rule, [i_0_3])).
% 3.45/2.32 cnf(i_0_384040, plain, (join(meet(join(meet(X1,join(join(a,b),c)),meet(join(join(a,b),c),join(X1,join(join(a,b),c)))),X3),meet(join(meet(X1,join(join(meet(X4,join(join(a,b),c)),meet(join(join(a,b),c),X5)),join(join(a,b),c))),meet(join(meet(join(join(a,b),c),meet(meet(join(X4,join(join(join(a,b),c),X5)),join(X6,join(join(a,b),c))),join(join(a,b),c))),meet(X7,join(join(join(a,b),c),meet(meet(join(X4,join(join(join(a,b),c),X5)),join(X6,join(join(a,b),c))),join(join(a,b),c))))),join(X1,join(join(meet(X4,join(join(a,b),c)),meet(join(join(a,b),c),X5)),join(join(a,b),c))))),join(join(meet(X1,join(join(a,b),c)),meet(join(join(a,b),c),join(X1,join(join(a,b),c)))),X3)))!=join(meet(join(meet(X18,join(a,join(b,c))),meet(join(a,join(b,c)),join(X18,join(a,join(b,c))))),X17),meet(join(meet(X18,join(join(meet(X16,join(a,join(b,c))),meet(join(a,join(b,c)),X15)),join(a,join(b,c)))),meet(join(meet(join(a,join(b,c)),meet(meet(join(X16,join(join(a,join(b,c)),X15)),join(X14,join(a,join(b,c)))),join(a,join(b,c)))),meet(X13,join(join(a,join(b,c)),meet(meet(join(X16,join(join(a,join(b,c)),X15)),join(X14,join(a,join(b,c)))),join(a,join(b,c)))))),join(X18,join(join(meet(X16,join(a,join(b,c))),meet(join(a,join(b,c)),X15)),join(a,join(b,c)))))),join(join(meet(X18,join(a,join(b,c))),meet(join(a,join(b,c)),join(X18,join(a,join(b,c))))),X17)))), inference(etableau_closure_rule, [i_0_384040, ...])).
% 3.45/2.32 # End printing tableau
% 3.45/2.32 # SZS output end
% 3.45/2.32 # Branches closed with saturation will be marked with an "s"
% 3.45/2.32 # Child (11128) has found a proof.
% 3.45/2.32
% 3.45/2.32 # Proof search is over...
% 3.45/2.32 # Freeing feature tree
%------------------------------------------------------------------------------