%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT055-1 : TPTP v8.1.0. Released v2.5.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 : n021.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:42 EDT 2022 % Result : Satisfiable 15.29s 2.33s % Output : CNFRefutation 15.29s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : LAT055-1 : TPTP v8.1.0. Released v2.5.0. % 0.08/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n021.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jun 30 15:01:28 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S % 0.13/0.37 # and selection function SelectNewComplexAHP. % 0.13/0.37 # % 0.13/0.37 # Number of axioms: 20 Number of unprocessed: 20 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 20 beginning clauses after preprocessing and clausification % 0.13/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.13/0.37 # No conjectures. % 0.13/0.37 # There are 20 start rule candidates: % 0.13/0.37 # Found 8 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 20 start rule tableaux created. % 0.13/0.37 # 12 extension rule candidate clauses % 0.13/0.37 # 8 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 15.29/2.33 # 2566 Satisfiable branch % 15.29/2.33 # Satisfiable branch found. % 15.29/2.33 # There were 4 total branch saturation attempts. % 15.29/2.33 # There were 1 of these attempts blocked. % 15.29/2.33 # There were 0 deferred branch saturation attempts. % 15.29/2.33 # There were 0 free duplicated saturations. % 15.29/2.33 # There were 0 total successful branch saturations. % 15.29/2.33 # There were 0 successful branch saturations in interreduction. % 15.29/2.33 # There were 0 successful branch saturations on the branch. % 15.29/2.33 # There were 0 successful branch saturations after the branch. % 15.29/2.33 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 15.29/2.33 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 15.29/2.33 # Begin clausification derivation % 15.29/2.33 % 15.29/2.33 # End clausification derivation % 15.29/2.33 # Begin listing active clauses obtained from FOF to CNF conversion % 15.29/2.33 cnf(i_0_21, plain, (join(n1,X1,n1))). % 15.29/2.33 cnf(i_0_24, plain, (meet(n0,X1,n0))). % 15.29/2.33 cnf(i_0_23, plain, (join(n0,X1,X1))). % 15.29/2.33 cnf(i_0_26, plain, (meet(n1,X1,X1))). % 15.29/2.33 cnf(i_0_22, plain, (join(X1,X1,X1))). % 15.29/2.33 cnf(i_0_25, plain, (meet(X1,X1,X1))). % 15.29/2.33 cnf(i_0_39, plain, (join(X1,X2,join_of(X1,X2)))). % 15.29/2.33 cnf(i_0_37, plain, (meet(X1,X2,meet_of(X1,X2)))). % 15.29/2.33 cnf(i_0_28, plain, (join(X2,X1,X3)|~join(X1,X2,X3))). % 15.29/2.33 cnf(i_0_29, plain, (join(X1,X3,X1)|~meet(X1,X2,X3))). % 15.29/2.33 cnf(i_0_27, plain, (meet(X2,X1,X3)|~meet(X1,X2,X3))). % 15.29/2.33 cnf(i_0_30, plain, (meet(X1,X3,X1)|~join(X1,X2,X3))). % 15.29/2.33 cnf(i_0_40, plain, (X3=X4|~join(X1,X2,X4)|~join(X1,X2,X3))). % 15.29/2.33 cnf(i_0_38, plain, (X3=X4|~meet(X1,X2,X4)|~meet(X1,X2,X3))). % 15.29/2.33 cnf(i_0_33, plain, (join(X3,X4,X6)|~join(X2,X4,X5)|~join(X1,X5,X6)|~join(X1,X2,X3))). % 15.29/2.33 cnf(i_0_34, plain, (join(X1,X5,X6)|~join(X3,X4,X6)|~join(X2,X4,X5)|~join(X1,X2,X3))). % 15.29/2.33 cnf(i_0_31, plain, (meet(X3,X4,X6)|~meet(X2,X4,X5)|~meet(X1,X5,X6)|~meet(X1,X2,X3))). % 15.29/2.33 cnf(i_0_32, plain, (meet(X1,X5,X6)|~meet(X3,X4,X6)|~meet(X2,X4,X5)|~meet(X1,X2,X3))). % 15.29/2.33 cnf(i_0_35, plain, (join(X1,X5,X6)|~join(X1,X3,X4)|~meet(X3,X2,X5)|~meet(X2,X4,X6)|~meet(X1,X2,X1))). % 15.29/2.33 cnf(i_0_36, plain, (meet(X2,X4,X6)|~join(X1,X5,X6)|~join(X1,X3,X4)|~meet(X3,X2,X5)|~meet(X1,X2,X1))). % 15.29/2.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 15.29/2.33 # Begin printing tableau % 15.29/2.33 # Found 9 steps % 15.29/2.33 cnf(i_0_25, plain, (meet(n0,n0,n0)), inference(start_rule)). % 15.29/2.33 cnf(i_0_46, plain, (meet(n0,n0,n0)), inference(extension_rule, [i_0_35])). % 15.29/2.33 cnf(i_0_153662, plain, (~join(n1,n0,n1)), inference(closure_rule, [i_0_21])). % 15.29/2.33 cnf(i_0_153664, plain, (~meet(n0,n1,n0)), inference(closure_rule, [i_0_24])). % 15.29/2.33 cnf(i_0_153661, plain, (join(n1,n0,n0)), inference(extension_rule, [i_0_28])). % 15.29/2.33 cnf(i_0_153666, plain, (join(n0,n1,n0)), inference(extension_rule, [i_0_33])). % 15.29/2.33 cnf(i_0_293640, plain, (~join(n1,n0,n1)), inference(closure_rule, [i_0_21])). % 15.29/2.33 cnf(i_0_293641, plain, (~join(n1,n0,n1)), inference(closure_rule, [i_0_21])). % 15.29/2.33 cnf(i_0_153665, plain, (~meet(n1,n0,n1)), inference(extension_rule, [i_0_27])). % 15.29/2.33 # End printing tableau % 15.29/2.33 # SZS output end % 15.29/2.33 # Branches closed with saturation will be marked with an "s" % 15.29/2.33 # Child (2566) has found a proof. % 15.29/2.33 % 15.29/2.33 # Proof search is over... % 15.29/2.33 # Freeing feature tree %------------------------------------------------------------------------------