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