%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PHI011+1 : TPTP v8.1.0. Released v7.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 : n017.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 : Mon Jul 18 16:45:35 EDT 2022 % Result : Theorem 0.21s 0.38s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : PHI011+1 : TPTP v8.1.0. Released v7.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 : n017.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 : Thu Jun 2 00:16:42 EDT 2022 % 0.14/0.35 % CPUTime : % 0.21/0.37 # No SInE strategy applied % 0.21/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.21/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.21/0.37 # % 0.21/0.37 # Presaturation interreduction done % 0.21/0.37 # Number of axioms: 12 Number of unprocessed: 12 % 0.21/0.37 # Tableaux proof search. % 0.21/0.37 # APR header successfully linked. % 0.21/0.37 # Hello from C++ % 0.21/0.38 # The folding up rule is enabled... % 0.21/0.38 # Local unification is enabled... % 0.21/0.38 # Any saturation attempts will use folding labels... % 0.21/0.38 # 12 beginning clauses after preprocessing and clausification % 0.21/0.38 # Creating start rules for all 6 conjectures. % 0.21/0.38 # There are 6 start rule candidates: % 0.21/0.38 # Found 6 unit axioms. % 0.21/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.21/0.38 # 6 start rule tableaux created. % 0.21/0.38 # 6 extension rule candidate clauses % 0.21/0.38 # 6 unit axiom clauses % 0.21/0.38 % 0.21/0.38 # Requested 8, 32 cores available to the main process. % 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 6 % 0.21/0.38 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done. % 0.21/0.38 # There were 0 total branch saturation attempts. % 0.21/0.38 # There were 0 of these attempts blocked. % 0.21/0.38 # There were 0 deferred branch saturation attempts. % 0.21/0.38 # There were 0 free duplicated saturations. % 0.21/0.38 # There were 0 total successful branch saturations. % 0.21/0.38 # There were 0 successful branch saturations in interreduction. % 0.21/0.38 # There were 0 successful branch saturations on the branch. % 0.21/0.38 # There were 0 successful branch saturations after the branch. % 0.21/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.38 # Begin clausification derivation % 0.21/0.38 % 0.21/0.38 # End clausification derivation % 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.38 cnf(i_0_11, negated_conjecture, (object(esk2_0))). % 0.21/0.38 cnf(i_0_9, negated_conjecture, (object(esk3_0))). % 0.21/0.38 cnf(i_0_12, negated_conjecture, (property(esk1_0))). % 0.21/0.38 cnf(i_0_10, negated_conjecture, (is_the(esk2_0,esk1_0))). % 0.21/0.38 cnf(i_0_8, negated_conjecture, (is_the(esk3_0,esk1_0))). % 0.21/0.38 cnf(i_0_7, negated_conjecture, (~exemplifies_property(esk1_0,esk3_0))). % 0.21/0.38 cnf(i_0_2, plain, (object(X1)|~exemplifies_property(X2,X1))). % 0.21/0.38 cnf(i_0_1, plain, (~property(X1)|~object(X1))). % 0.21/0.38 cnf(i_0_4, plain, (object(X1)|~is_the(X1,X2))). % 0.21/0.38 cnf(i_0_3, plain, (property(X1)|~exemplifies_property(X1,X2))). % 0.21/0.38 cnf(i_0_5, plain, (property(X1)|~is_the(X2,X1))). % 0.21/0.38 cnf(i_0_6, plain, (exemplifies_property(X1,X2)|~is_the(X2,X1))). % 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.38 # Begin printing tableau % 0.21/0.38 # Found 3 steps % 0.21/0.38 cnf(i_0_7, negated_conjecture, (~exemplifies_property(esk1_0,esk3_0)), inference(start_rule)). % 0.21/0.38 cnf(i_0_14, plain, (~exemplifies_property(esk1_0,esk3_0)), inference(extension_rule, [i_0_6])). % 0.21/0.38 cnf(i_0_31, plain, (~is_the(esk3_0,esk1_0)), inference(closure_rule, [i_0_8])). % 0.21/0.38 # End printing tableau % 0.21/0.38 # SZS output end % 0.21/0.38 # Branches closed with saturation will be marked with an "s" % 0.21/0.38 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 0.21/0.38 # We now have 6 tableaux to operate on % 0.21/0.38 # Found closed tableau during pool population. % 0.21/0.38 # Proof search is over... % 0.21/0.38 # Freeing feature tree %------------------------------------------------------------------------------