%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MSC004-1 : TPTP v8.1.0. Released v1.0.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 : n008.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 22:43:12 EDT 2022 % Result : Unsatisfiable 0.14s 0.32s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.09 % Problem : MSC004-1 : TPTP v8.1.0. Released v1.0.0. % 0.00/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.29 % Computer : n008.cluster.edu % 0.09/0.29 % Model : x86_64 x86_64 % 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.29 % Memory : 8042.1875MB % 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.29 % CPULimit : 300 % 0.09/0.29 % WCLimit : 600 % 0.09/0.29 % DateTime : Fri Jul 1 16:13:08 EDT 2022 % 0.09/0.29 % CPUTime : % 0.14/0.32 # No SInE strategy applied % 0.14/0.32 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.32 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.32 # % 0.14/0.32 # Presaturation interreduction done % 0.14/0.32 # Number of axioms: 8 Number of unprocessed: 8 % 0.14/0.32 # Tableaux proof search. % 0.14/0.32 # APR header successfully linked. % 0.14/0.32 # Hello from C++ % 0.14/0.32 # The folding up rule is enabled... % 0.14/0.32 # Local unification is enabled... % 0.14/0.32 # Any saturation attempts will use folding labels... % 0.14/0.32 # 8 beginning clauses after preprocessing and clausification % 0.14/0.32 # Creating start rules for all 1 conjectures. % 0.14/0.32 # There are 1 start rule candidates: % 0.14/0.32 # Found 2 unit axioms. % 0.14/0.32 # 1 start rule tableaux created. % 0.14/0.32 # 6 extension rule candidate clauses % 0.14/0.32 # 2 unit axiom clauses % 0.14/0.32 % 0.14/0.32 # Requested 8, 32 cores available to the main process. % 0.14/0.32 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.32 # There were 3 total branch saturation attempts. % 0.14/0.32 # There were 0 of these attempts blocked. % 0.14/0.32 # There were 0 deferred branch saturation attempts. % 0.14/0.32 # There were 0 free duplicated saturations. % 0.14/0.32 # There were 3 total successful branch saturations. % 0.14/0.32 # There were 0 successful branch saturations in interreduction. % 0.14/0.32 # There were 0 successful branch saturations on the branch. % 0.14/0.32 # There were 3 successful branch saturations after the branch. % 0.14/0.32 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.32 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.32 # Begin clausification derivation % 0.14/0.32 % 0.14/0.32 # End clausification derivation % 0.14/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.32 cnf(i_0_11, hypothesis, (in(john,boy))). % 0.14/0.32 cnf(i_0_16, negated_conjecture, (~has_parts(john,times(times(n2,n1),n5),fingers))). % 0.14/0.32 cnf(i_0_13, hypothesis, (has_parts(X1,n5,fingers)|~in(X1,hand))). % 0.14/0.32 cnf(i_0_14, hypothesis, (has_parts(X1,n2,arm)|~in(X1,human))). % 0.14/0.32 cnf(i_0_15, hypothesis, (has_parts(X1,n1,hand)|~in(X1,arm))). % 0.14/0.32 cnf(i_0_12, hypothesis, (in(X1,human)|~in(X1,boy))). % 0.14/0.32 cnf(i_0_9, plain, (has_parts(X1,times(X2,X3),X4)|in(object_in(X1,X5,X4,X2,X3),X5)|~has_parts(X1,X2,X5))). % 0.14/0.32 cnf(i_0_10, plain, (has_parts(X1,times(X2,X3),X4)|~has_parts(object_in(X1,X5,X4,X2,X3),X3,X4)|~has_parts(X1,X2,X5))). % 0.14/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.32 # Begin printing tableau % 0.14/0.32 # Found 8 steps % 0.14/0.32 cnf(i_0_16, negated_conjecture, (~has_parts(john,times(times(n2,n1),n5),fingers)), inference(start_rule)). % 0.14/0.32 cnf(i_0_17, plain, (~has_parts(john,times(times(n2,n1),n5),fingers)), inference(extension_rule, [i_0_10])). % 0.14/0.32 cnf(i_0_31, plain, (~has_parts(john,times(n2,n1),hand)), inference(extension_rule, [i_0_10])). % 0.14/0.32 cnf(i_0_58, plain, (~has_parts(object_in(john,arm,hand,n2,n1),n1,hand)), inference(extension_rule, [i_0_15])). % 0.14/0.32 cnf(i_0_30, plain, (~has_parts(object_in(john,hand,fingers,times(n2,n1),n5),n5,fingers)), inference(etableau_closure_rule, [i_0_30, ...])). % 0.14/0.32 cnf(i_0_59, plain, (~has_parts(john,n2,arm)), inference(extension_rule, [i_0_14])). % 0.14/0.32 cnf(i_0_65, plain, (~in(object_in(john,arm,hand,n2,n1),arm)), inference(etableau_closure_rule, [i_0_65, ...])). % 0.14/0.32 cnf(i_0_102, plain, (~in(john,human)), inference(etableau_closure_rule, [i_0_102, ...])). % 0.14/0.32 # End printing tableau % 0.14/0.32 # SZS output end % 0.14/0.32 # Branches closed with saturation will be marked with an "s" % 0.14/0.32 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.14/0.32 # We now have 4 tableaux to operate on % 0.14/0.32 # Found closed tableau during pool population. % 0.14/0.32 # Proof search is over... % 0.14/0.32 # Freeing feature tree %------------------------------------------------------------------------------