TSTP Solution File: LAT183-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT183-10 : TPTP v8.1.0. Released v7.3.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 : n006.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:49:19 EDT 2022
% Result : Unsatisfiable 13.65s 2.11s
% Output : CNFRefutation 13.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT183-10 : TPTP v8.1.0. Released v7.3.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.33 % Computer : n006.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Thu Jun 30 08:22:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 # No SInE strategy applied
% 0.14/0.36 # Auto-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.14/0.36 # and selection function SelectNewComplexAHP.
% 0.14/0.36 #
% 0.14/0.36 # Presaturation interreduction done
% 0.14/0.36 # Number of axioms: 14 Number of unprocessed: 14
% 0.14/0.36 # Tableaux proof search.
% 0.14/0.36 # APR header successfully linked.
% 0.14/0.36 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 14 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 1 conjectures.
% 0.14/0.37 # There are 1 start rule candidates:
% 0.14/0.37 # Found 14 unit axioms.
% 0.14/0.37 # 1 start rule tableaux created.
% 0.14/0.37 # 0 extension rule candidate clauses
% 0.14/0.37 # 14 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.37 # Creating equality axioms
% 0.14/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.37 # Returning from population with 25 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 25 tableaux to operate on
% 13.65/2.11 # There were 1 total branch saturation attempts.
% 13.65/2.11 # There were 0 of these attempts blocked.
% 13.65/2.11 # There were 0 deferred branch saturation attempts.
% 13.65/2.11 # There were 0 free duplicated saturations.
% 13.65/2.11 # There were 1 total successful branch saturations.
% 13.65/2.11 # There were 0 successful branch saturations in interreduction.
% 13.65/2.11 # There were 0 successful branch saturations on the branch.
% 13.65/2.11 # There were 1 successful branch saturations after the branch.
% 13.65/2.11 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.65/2.11 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.65/2.11 # Begin clausification derivation
% 13.65/2.11
% 13.65/2.11 # End clausification derivation
% 13.65/2.11 # Begin listing active clauses obtained from FOF to CNF conversion
% 13.65/2.11 cnf(i_0_25, plain, (meet(X1,complement(X1))=zero)).
% 13.65/2.11 cnf(i_0_24, plain, (join(X1,complement(X1))=one)).
% 13.65/2.11 cnf(i_0_16, plain, (meet(X1,X1)=X1)).
% 13.65/2.11 cnf(i_0_17, plain, (join(X1,X1)=X1)).
% 13.65/2.11 cnf(i_0_18, plain, (meet(X1,join(X1,X2))=X1)).
% 13.65/2.11 cnf(i_0_19, plain, (join(X1,meet(X1,X2))=X1)).
% 13.65/2.11 cnf(i_0_26, plain, (ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2)=X2)).
% 13.65/2.11 cnf(i_0_15, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 13.65/2.11 cnf(i_0_22, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))).
% 13.65/2.11 cnf(i_0_23, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 13.65/2.11 cnf(i_0_27, plain, (meet(X1,join(X2,meet(X1,join(meet(X1,X2),meet(X3,join(X1,X2))))))=meet(X1,join(X2,meet(X1,X3))))).
% 13.65/2.11 cnf(i_0_20, plain, (meet(X1,X2)=meet(X2,X1))).
% 13.65/2.11 cnf(i_0_21, plain, (join(X1,X2)=join(X2,X1))).
% 13.65/2.11 cnf(i_0_28, negated_conjecture, (join(meet(a,b),meet(a,c))!=meet(a,join(b,c)))).
% 13.65/2.11 cnf(i_0_30, plain, (X4=X4)).
% 13.65/2.11 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 13.65/2.11 # Begin printing tableau
% 13.65/2.11 # Found 8 steps
% 13.65/2.11 cnf(i_0_25, plain, (meet(X19,complement(X19))=zero), inference(start_rule)).
% 13.65/2.11 cnf(i_0_38, plain, (meet(X19,complement(X19))=zero), inference(extension_rule, [i_0_34])).
% 13.65/2.11 cnf(i_0_61, plain, (meet(ifeq(zero,zero,zero,zero),complement(ifeq(zero,zero,zero,zero)))!=zero), inference(closure_rule, [i_0_25])).
% 13.65/2.11 cnf(i_0_63, plain, (meet(ifeq(zero,zero,zero,zero),complement(ifeq(zero,zero,zero,zero)))!=zero), inference(closure_rule, [i_0_25])).
% 13.65/2.11 cnf(i_0_64, plain, (meet(ifeq(zero,zero,zero,zero),complement(ifeq(zero,zero,zero,zero)))!=zero), inference(closure_rule, [i_0_25])).
% 13.65/2.11 cnf(i_0_60, plain, (ifeq(meet(ifeq(zero,zero,zero,zero),complement(ifeq(zero,zero,zero,zero))),meet(X19,complement(X19)),meet(ifeq(zero,zero,zero,zero),complement(ifeq(zero,zero,zero,zero))),meet(ifeq(zero,zero,zero,zero),complement(ifeq(zero,zero,zero,zero))))=ifeq(zero,zero,zero,zero)), inference(extension_rule, [i_0_33])).
% 13.65/2.11 cnf(i_0_79, plain, (ifeq(zero,zero,zero,zero)!=meet(ifeq(zero,zero,zero,zero),ifeq(zero,zero,zero,zero))), inference(closure_rule, [i_0_16])).
% 13.65/2.11 cnf(i_0_77, plain, (ifeq(meet(ifeq(zero,zero,zero,zero),complement(ifeq(zero,zero,zero,zero))),meet(X19,complement(X19)),meet(ifeq(zero,zero,zero,zero),complement(ifeq(zero,zero,zero,zero))),meet(ifeq(zero,zero,zero,zero),complement(ifeq(zero,zero,zero,zero))))=meet(ifeq(zero,zero,zero,zero),ifeq(zero,zero,zero,zero))), inference(etableau_closure_rule, [i_0_77, ...])).
% 13.65/2.11 # End printing tableau
% 13.65/2.11 # SZS output end
% 13.65/2.11 # Branches closed with saturation will be marked with an "s"
% 13.65/2.11 # There were 1 total branch saturation attempts.
% 13.65/2.11 # There were 0 of these attempts blocked.
% 13.65/2.11 # There were 0 deferred branch saturation attempts.
% 13.65/2.11 # There were 0 free duplicated saturations.
% 13.65/2.11 # There were 1 total successful branch saturations.
% 13.65/2.11 # There were 0 successful branch saturations in interreduction.
% 13.65/2.11 # There were 0 successful branch saturations on the branch.
% 13.65/2.11 # There were 1 successful branch saturations after the branch.
% 13.65/2.11 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.65/2.11 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.65/2.11 # Begin clausification derivation
% 13.65/2.11
% 13.65/2.11 # End clausification derivation
% 13.65/2.11 # Begin listing active clauses obtained from FOF to CNF conversion
% 13.65/2.11 cnf(i_0_25, plain, (meet(X1,complement(X1))=zero)).
% 13.65/2.11 cnf(i_0_24, plain, (join(X1,complement(X1))=one)).
% 13.65/2.11 cnf(i_0_16, plain, (meet(X1,X1)=X1)).
% 13.65/2.11 cnf(i_0_17, plain, (join(X1,X1)=X1)).
% 13.65/2.11 cnf(i_0_18, plain, (meet(X1,join(X1,X2))=X1)).
% 13.65/2.11 cnf(i_0_19, plain, (join(X1,meet(X1,X2))=X1)).
% 13.65/2.11 cnf(i_0_26, plain, (ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2)=X2)).
% 13.65/2.11 cnf(i_0_15, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 13.65/2.11 cnf(i_0_22, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))).
% 13.65/2.11 cnf(i_0_23, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 13.65/2.11 cnf(i_0_27, plain, (meet(X1,join(X2,meet(X1,join(meet(X1,X2),meet(X3,join(X1,X2))))))=meet(X1,join(X2,meet(X1,X3))))).
% 13.65/2.11 cnf(i_0_20, plain, (meet(X1,X2)=meet(X2,X1))).
% 13.65/2.11 cnf(i_0_21, plain, (join(X1,X2)=join(X2,X1))).
% 13.65/2.11 cnf(i_0_28, negated_conjecture, (join(meet(a,b),meet(a,c))!=meet(a,join(b,c)))).
% 13.65/2.11 cnf(i_0_30, plain, (X4=X4)).
% 13.65/2.11 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 13.65/2.11 # Begin printing tableau
% 13.65/2.11 # Found 6 steps
% 13.65/2.11 cnf(i_0_25, plain, (meet(X7,complement(X7))=zero), inference(start_rule)).
% 13.65/2.11 cnf(i_0_38, plain, (meet(X7,complement(X7))=zero), inference(extension_rule, [i_0_36])).
% 13.65/2.11 cnf(i_0_69, plain, (meet(join(zero,zero),complement(join(zero,zero)))!=zero), inference(closure_rule, [i_0_25])).
% 13.65/2.11 cnf(i_0_68, plain, (join(meet(join(zero,zero),complement(join(zero,zero))),meet(X7,complement(X7)))=join(zero,zero)), inference(extension_rule, [i_0_33])).
% 13.65/2.11 cnf(i_0_79, plain, (join(zero,zero)!=meet(join(zero,zero),join(zero,zero))), inference(closure_rule, [i_0_16])).
% 13.65/2.11 cnf(i_0_77, plain, (join(meet(join(zero,zero),complement(join(zero,zero))),meet(X7,complement(X7)))=meet(join(zero,zero),join(zero,zero))), inference(etableau_closure_rule, [i_0_77, ...])).
% 13.65/2.11 # End printing tableau
% 13.65/2.11 # SZS output end
% 13.65/2.11 # Branches closed with saturation will be marked with an "s"
% 14.08/2.12 # Child (1292) has found a proof.
% 14.08/2.12
% 14.08/2.12 # Proof search is over...
% 14.08/2.12 # Freeing feature tree
%------------------------------------------------------------------------------