TSTP Solution File: LAT196-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT196-1 : TPTP v8.1.0. Released v3.1.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 : n007.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:24 EDT 2022
% Result : Unsatisfiable 2.04s 0.71s
% Output : CNFRefutation 2.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LAT196-1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 29 10:46:37 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.14/0.39 # and selection function SelectNewComplexAHP.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 13 Number of unprocessed: 13
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 13 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 1 conjectures.
% 0.14/0.39 # There are 1 start rule candidates:
% 0.14/0.39 # Found 12 unit axioms.
% 0.14/0.39 # 1 start rule tableaux created.
% 0.14/0.39 # 1 extension rule candidate clauses
% 0.14/0.39 # 12 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Requested 8, 32 cores available to the main process.
% 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.39 # Creating equality axioms
% 0.14/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.39 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.39 # We now have 21 tableaux to operate on
% 2.04/0.71 # There were 1 total branch saturation attempts.
% 2.04/0.71 # There were 0 of these attempts blocked.
% 2.04/0.71 # There were 0 deferred branch saturation attempts.
% 2.04/0.71 # There were 0 free duplicated saturations.
% 2.04/0.71 # There were 1 total successful branch saturations.
% 2.04/0.71 # There were 0 successful branch saturations in interreduction.
% 2.04/0.71 # There were 0 successful branch saturations on the branch.
% 2.04/0.71 # There were 1 successful branch saturations after the branch.
% 2.04/0.71 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.04/0.71 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.04/0.71 # Begin clausification derivation
% 2.04/0.71
% 2.04/0.71 # End clausification derivation
% 2.04/0.71 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.04/0.71 cnf(i_0_23, plain, (meet(X1,complement(X1))=zero)).
% 2.04/0.71 cnf(i_0_22, plain, (join(X1,complement(X1))=one)).
% 2.04/0.71 cnf(i_0_14, plain, (meet(X1,X1)=X1)).
% 2.04/0.71 cnf(i_0_15, plain, (join(X1,X1)=X1)).
% 2.04/0.71 cnf(i_0_16, plain, (meet(X1,join(X1,X2))=X1)).
% 2.04/0.71 cnf(i_0_17, plain, (join(X1,meet(X1,X2))=X1)).
% 2.04/0.71 cnf(i_0_20, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))).
% 2.04/0.71 cnf(i_0_21, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 2.04/0.71 cnf(i_0_25, plain, (meet(X1,join(X2,meet(X3,join(X4,meet(X1,X3)))))=meet(X1,join(X2,meet(X3,join(X1,X4)))))).
% 2.04/0.71 cnf(i_0_18, plain, (meet(X1,X2)=meet(X2,X1))).
% 2.04/0.71 cnf(i_0_19, plain, (join(X1,X2)=join(X2,X1))).
% 2.04/0.71 cnf(i_0_26, negated_conjecture, (join(meet(a,b),meet(a,c))!=meet(a,join(b,c)))).
% 2.04/0.71 cnf(i_0_24, plain, (complement(X1)=X2|meet(X1,X2)!=zero|join(X1,X2)!=one)).
% 2.04/0.71 cnf(i_0_31, plain, (X5=X5)).
% 2.04/0.71 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.04/0.71 # Begin printing tableau
% 2.04/0.71 # Found 8 steps
% 2.04/0.71 cnf(i_0_23, plain, (meet(X8,complement(X8))=zero), inference(start_rule)).
% 2.04/0.71 cnf(i_0_38, plain, (meet(X8,complement(X8))=zero), inference(extension_rule, [i_0_34])).
% 2.04/0.71 cnf(i_0_63, plain, (meet(meet(X1,complement(X1)),complement(meet(X1,complement(X1))))!=zero), inference(closure_rule, [i_0_23])).
% 2.04/0.71 cnf(i_0_61, plain, (meet(X8,complement(X8))=meet(meet(X1,complement(X1)),complement(meet(X1,complement(X1))))), inference(extension_rule, [i_0_34])).
% 2.04/0.71 cnf(i_0_81, plain, (meet(meet(X1,complement(X1)),complement(meet(X1,complement(X1))))!=meet(zero,complement(meet(X1,complement(X1))))), inference(extension_rule, [i_0_35])).
% 2.04/0.71 cnf(i_0_126, plain, (meet(X1,complement(X1))!=zero), inference(closure_rule, [i_0_23])).
% 2.04/0.71 cnf(i_0_127, plain, ($false), inference(closure_rule, [i_0_31])).
% 2.04/0.71 cnf(i_0_79, plain, (meet(X8,complement(X8))=meet(zero,complement(meet(X1,complement(X1))))), inference(etableau_closure_rule, [i_0_79, ...])).
% 2.04/0.71 # End printing tableau
% 2.04/0.71 # SZS output end
% 2.04/0.71 # Branches closed with saturation will be marked with an "s"
% 2.04/0.71 # Child (29264) has found a proof.
% 2.04/0.71
% 2.04/0.71 # Proof search is over...
% 2.04/0.71 # Freeing feature tree
%------------------------------------------------------------------------------