%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT093-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 : 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:48:54 EDT 2022 % Result : Unsatisfiable 0.18s 0.45s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : LAT093-1 : TPTP v8.1.0. Released v2.6.0. % 0.11/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 : n006.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 00:41:53 EDT 2022 % 0.12/0.33 % 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.12/0.40 # The folding up rule is enabled... % 0.12/0.40 # Local unification is enabled... % 0.12/0.40 # Any saturation attempts will use folding labels... % 0.12/0.40 # 2 beginning clauses after preprocessing and clausification % 0.12/0.40 # Creating start rules for all 1 conjectures. % 0.12/0.40 # There are 1 start rule candidates: % 0.12/0.40 # Found 2 unit axioms. % 0.12/0.40 # 1 start rule tableaux created. % 0.12/0.40 # 0 extension rule candidate clauses % 0.12/0.40 # 2 unit axiom clauses % 0.12/0.40 % 0.12/0.40 # Requested 8, 32 cores available to the main process. % 0.12/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.40 # Creating equality axioms % 0.12/0.40 # Ran out of tableaux, making start rules for all clauses % 0.12/0.40 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.40 # We now have 8 tableaux to operate on % 0.18/0.45 # There were 3 total branch saturation attempts. % 0.18/0.45 # There were 0 of these attempts blocked. % 0.18/0.45 # There were 0 deferred branch saturation attempts. % 0.18/0.45 # There were 1 free duplicated saturations. % 0.18/0.45 # There were 3 total successful branch saturations. % 0.18/0.45 # There were 0 successful branch saturations in interreduction. % 0.18/0.45 # There were 0 successful branch saturations on the branch. % 0.18/0.45 # There were 2 successful branch saturations after the branch. % 0.18/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.45 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.45 # Begin clausification derivation % 0.18/0.45 % 0.18/0.45 # End clausification derivation % 0.18/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.45 cnf(i_0_4, negated_conjecture, (meet(b,a)!=meet(a,b))). % 0.18/0.45 cnf(i_0_3, plain, (join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)),meet(X6,join(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3)))=X2)). % 0.18/0.45 cnf(i_0_6, plain, (X7=X7)). % 0.18/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.45 # Begin printing tableau % 0.18/0.45 # Found 6 steps % 0.18/0.45 cnf(i_0_6, plain, (b=b), inference(start_rule)). % 0.18/0.45 cnf(i_0_14, plain, (b=b), inference(extension_rule, [i_0_10])). % 0.18/0.45 cnf(i_0_2522, plain, ($false), inference(closure_rule, [i_0_6])). % 0.18/0.45 cnf(i_0_2520, plain, (meet(b,a)=meet(b,a)), inference(extension_rule, [i_0_9])). % 0.18/0.45 cnf(i_0_2527, plain, (meet(b,a)=meet(a,b)), inference(closure_rule, [i_0_4])). % 0.18/0.45 cnf(i_0_2529, plain, (meet(b,a)!=meet(a,b)), inference(etableau_closure_rule, [i_0_2529, ...])). % 0.18/0.45 # End printing tableau % 0.18/0.45 # SZS output end % 0.18/0.45 # Branches closed with saturation will be marked with an "s" % 0.18/0.45 # Child (30898) has found a proof. % 0.18/0.45 % 0.18/0.45 # Proof search is over... % 0.18/0.45 # Freeing feature tree %------------------------------------------------------------------------------