%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET978+1 : TPTP v8.1.0. Released v3.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 : n004.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 : Tue Jul 19 01:04:14 EDT 2022 % Result : Theorem 0.20s 0.37s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET978+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n004.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sat Jul 9 15:57:52 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.14/0.37 # and selection function SelectUnlessUniqMax. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 8 Number of unprocessed: 8 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 8 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 2 conjectures. % 0.20/0.37 # There are 2 start rule candidates: % 0.20/0.37 # Found 3 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 2 start rule tableaux created. % 0.20/0.37 # 5 extension rule candidate clauses % 0.20/0.37 # 3 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_1, plain, (empty(esk1_0))). % 0.20/0.37 cnf(i_0_7, negated_conjecture, (esk3_0!=esk4_0)). % 0.20/0.37 cnf(i_0_2, plain, (~empty(esk2_0))). % 0.20/0.37 cnf(i_0_6, negated_conjecture, (~disjoint(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk6_0,singleton(esk4_0)))|~disjoint(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk6_0)))). % 0.20/0.37 cnf(i_0_3, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.20/0.37 cnf(i_0_8, plain, (X1=X2|disjoint(singleton(X1),singleton(X2)))). % 0.20/0.37 cnf(i_0_4, plain, (disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~disjoint(X2,X4))). % 0.20/0.37 cnf(i_0_5, plain, (disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~disjoint(X1,X3))). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 4 steps % 0.20/0.37 cnf(i_0_7, negated_conjecture, (esk3_0!=esk4_0), inference(start_rule)). % 0.20/0.37 cnf(i_0_11, plain, (esk3_0!=esk4_0), inference(extension_rule, [i_0_8])). % 0.20/0.37 cnf(i_0_35, plain, (disjoint(singleton(esk3_0),singleton(esk4_0))), inference(extension_rule, [i_0_3])). % 0.20/0.37 cnf(i_0_42, plain, (disjoint(singleton(esk4_0),singleton(esk3_0))), inference(etableau_closure_rule, [i_0_42, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 7 tableaux to operate on % 0.20/0.37 # Found closed tableau during pool population. % 0.20/0.37 # Proof search is over... % 0.20/0.37 # Freeing feature tree %------------------------------------------------------------------------------