%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT006-1 : TPTP v8.1.0. Released v2.2.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 : n013.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:26 EDT 2022 % Result : Unsatisfiable 0.18s 0.44s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : LAT006-1 : TPTP v8.1.0. Released v2.2.0. % 0.06/0.12 % 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 : n013.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 : Thu Jun 30 04:42:14 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.35 # No SInE strategy applied % 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN % 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.35 # % 0.12/0.35 # Presaturation interreduction done % 0.12/0.35 # Number of axioms: 3 Number of unprocessed: 3 % 0.12/0.35 # Tableaux proof search. % 0.12/0.35 # APR header successfully linked. % 0.12/0.35 # Hello from C++ % 0.12/0.35 # The folding up rule is enabled... % 0.12/0.35 # Local unification is enabled... % 0.12/0.35 # Any saturation attempts will use folding labels... % 0.12/0.35 # 3 beginning clauses after preprocessing and clausification % 0.12/0.35 # Creating start rules for all 1 conjectures. % 0.12/0.35 # There are 1 start rule candidates: % 0.12/0.35 # Found 3 unit axioms. % 0.12/0.35 # 1 start rule tableaux created. % 0.12/0.35 # 0 extension rule candidate clauses % 0.12/0.35 # 3 unit axiom clauses % 0.12/0.35 % 0.12/0.35 # Requested 8, 32 cores available to the main process. % 0.12/0.35 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.35 # Creating equality axioms % 0.12/0.35 # Ran out of tableaux, making start rules for all clauses % 0.12/0.35 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.35 # We now have 8 tableaux to operate on % 0.18/0.44 # There were 1 total branch saturation attempts. % 0.18/0.44 # There were 0 of these attempts blocked. % 0.18/0.44 # There were 0 deferred branch saturation attempts. % 0.18/0.44 # There were 0 free duplicated saturations. % 0.18/0.44 # There were 1 total successful branch saturations. % 0.18/0.44 # There were 0 successful branch saturations in interreduction. % 0.18/0.44 # There were 0 successful branch saturations on the branch. % 0.18/0.44 # There were 1 successful branch saturations after the branch. % 0.18/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.44 # Begin clausification derivation % 0.18/0.44 % 0.18/0.44 # End clausification derivation % 0.18/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.44 cnf(i_0_4, plain, (meet(X1,join(X1,X2))=X1)). % 0.18/0.44 cnf(i_0_5, plain, (join(meet(X1,X2),meet(X3,X2))=meet(X2,join(X3,X1)))). % 0.18/0.44 cnf(i_0_6, negated_conjecture, (meet(meet(a,b),c)!=meet(a,meet(b,c)))). % 0.18/0.44 cnf(i_0_8, plain, (X4=X4)). % 0.18/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.44 # Begin printing tableau % 0.18/0.44 # Found 6 steps % 0.18/0.44 cnf(i_0_4, plain, (meet(X4,join(X4,X11))=X4), inference(start_rule)). % 0.18/0.44 cnf(i_0_14, plain, (meet(X4,join(X4,X11))=X4), inference(extension_rule, [i_0_12])). % 0.18/0.44 cnf(i_0_27, plain, (meet(X6,join(X6,X2))!=X6), inference(closure_rule, [i_0_4])). % 0.18/0.44 cnf(i_0_25, plain, (join(meet(X4,join(X4,X11)),meet(X6,join(X6,X2)))=join(X4,X6)), inference(extension_rule, [i_0_11])). % 0.18/0.44 cnf(i_0_37, plain, (join(X4,X6)!=meet(join(X4,X6),join(join(X4,X6),X2))), inference(closure_rule, [i_0_4])). % 0.18/0.44 cnf(i_0_35, plain, (join(meet(X4,join(X4,X11)),meet(X6,join(X6,X2)))=meet(join(X4,X6),join(join(X4,X6),X2))), inference(etableau_closure_rule, [i_0_35, ...])). % 0.18/0.44 # End printing tableau % 0.18/0.44 # SZS output end % 0.18/0.44 # Branches closed with saturation will be marked with an "s" % 0.18/0.44 # Child (18448) has found a proof. % 0.18/0.44 % 0.18/0.44 # Proof search is over... % 0.18/0.44 # Freeing feature tree %------------------------------------------------------------------------------