%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MSC001-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 : n025.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:10 EDT 2022 % Result : Unsatisfiable 0.17s 0.36s % Output : CNFRefutation 0.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : MSC001-1 : TPTP v8.1.0. Released v1.0.0. % 0.12/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.32 % Computer : n025.cluster.edu % 0.13/0.32 % Model : x86_64 x86_64 % 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.32 % Memory : 8042.1875MB % 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.32 % CPULimit : 300 % 0.13/0.32 % WCLimit : 600 % 0.13/0.32 % DateTime : Fri Jul 1 16:34:54 EDT 2022 % 0.13/0.32 % CPUTime : % 0.17/0.35 # No SInE strategy applied % 0.17/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.17/0.35 # and selection function SelectUnlessUniqMax. % 0.17/0.35 # % 0.17/0.35 # Presaturation interreduction done % 0.17/0.35 # Number of axioms: 18 Number of unprocessed: 18 % 0.17/0.35 # Tableaux proof search. % 0.17/0.35 # APR header successfully linked. % 0.17/0.35 # Hello from C++ % 0.17/0.35 # The folding up rule is enabled... % 0.17/0.35 # Local unification is enabled... % 0.17/0.35 # Any saturation attempts will use folding labels... % 0.17/0.35 # 18 beginning clauses after preprocessing and clausification % 0.17/0.35 # Creating start rules for all 1 conjectures. % 0.17/0.35 # There are 1 start rule candidates: % 0.17/0.35 # Found 5 unit axioms. % 0.17/0.35 # 1 start rule tableaux created. % 0.17/0.35 # 13 extension rule candidate clauses % 0.17/0.35 # 5 unit axiom clauses % 0.17/0.35 % 0.17/0.35 # Requested 8, 32 cores available to the main process. % 0.17/0.35 # There are not enough tableaux to fork, creating more from the initial 1 % 0.17/0.35 # Ran out of tableaux, making start rules for all clauses % 0.17/0.35 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux. % 0.17/0.35 # We now have 24 tableaux to operate on % 0.17/0.36 # There were 1 total branch saturation attempts. % 0.17/0.36 # There were 0 of these attempts blocked. % 0.17/0.36 # There were 0 deferred branch saturation attempts. % 0.17/0.36 # There were 0 free duplicated saturations. % 0.17/0.36 # There were 1 total successful branch saturations. % 0.17/0.36 # There were 0 successful branch saturations in interreduction. % 0.17/0.36 # There were 0 successful branch saturations on the branch. % 0.17/0.36 # There were 1 successful branch saturations after the branch. % 0.17/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.17/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.17/0.36 # Begin clausification derivation % 0.17/0.36 % 0.17/0.36 # End clausification derivation % 0.17/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.17/0.36 cnf(i_0_23, plain, (at(thing(s),here,now))). % 0.17/0.36 cnf(i_0_22, plain, (at(hand,X1,do(go(X1),X2)))). % 0.17/0.36 cnf(i_0_36, negated_conjecture, (~answer(X1))). % 0.17/0.36 cnf(i_0_21, plain, (~red(hand))). % 0.17/0.36 cnf(i_0_20, plain, (~hold(thing(X1),do(let_go,X2)))). % 0.17/0.36 cnf(i_0_35, hypothesis, (red(X1)|~at(X1,here,now))). % 0.17/0.36 cnf(i_0_19, plain, (~at(X1,there,X2)|~at(X1,here,X2))). % 0.17/0.36 cnf(i_0_28, plain, (~red(X1)|~at(X1,there,X2))). % 0.17/0.36 cnf(i_0_34, plain, (at(X1,X2,X3)|~at(X1,X2,do(let_go,X3)))). % 0.17/0.36 cnf(i_0_27, plain, (at(hand,X1,X2)|~hold(thing(X3),X2)|~at(thing(X3),X1,X2))). % 0.17/0.36 cnf(i_0_33, plain, (at(X1,X2,do(let_go,X3))|~at(X1,X2,X3))). % 0.17/0.36 cnf(i_0_31, plain, (at(thing(taken(X1)),X2,X1)|~at(hand,X2,X1))). % 0.17/0.36 cnf(i_0_32, plain, (at(X1,X2,do(pick_up,X3))|~at(X1,X2,X3))). % 0.17/0.36 cnf(i_0_30, plain, (hold(thing(X1),do(go(X2),X3))|~hold(thing(X1),X3))). % 0.17/0.36 cnf(i_0_26, plain, (at(thing(X1),X2,X3)|~hold(thing(X1),X3)|~at(hand,X2,X3))). % 0.17/0.36 cnf(i_0_29, plain, (at(thing(X1),X2,do(go(X2),X3))|~at(thing(X1),X2,X3))). % 0.17/0.36 cnf(i_0_25, plain, (hold(thing(taken(X1)),do(pick_up,X1))|~at(thing(X2),X3,X1)|~at(hand,X3,X1))). % 0.17/0.36 cnf(i_0_24, plain, (hold(thing(X1),X2)|at(thing(X1),X3,X2)|~at(thing(X1),X3,do(go(X3),X2)))). % 0.17/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.17/0.36 # Begin printing tableau % 0.17/0.36 # Found 8 steps % 0.17/0.36 cnf(i_0_23, plain, (at(thing(s),here,now)), inference(start_rule)). % 0.17/0.36 cnf(i_0_68, plain, (at(thing(s),here,now)), inference(extension_rule, [i_0_27])). % 0.17/0.36 cnf(i_0_111, plain, (at(hand,here,now)), inference(extension_rule, [i_0_35])). % 0.17/0.36 cnf(i_0_133, plain, (red(hand)), inference(closure_rule, [i_0_21])). % 0.17/0.36 cnf(i_0_112, plain, (~hold(thing(s),now)), inference(extension_rule, [i_0_24])). % 0.17/0.36 cnf(i_0_161, plain, (at(thing(s),there,now)), inference(extension_rule, [i_0_19])). % 0.17/0.36 cnf(i_0_164, plain, (~at(thing(s),here,now)), inference(closure_rule, [i_0_23])). % 0.17/0.36 cnf(i_0_162, plain, (~at(thing(s),there,do(go(there),now))), inference(etableau_closure_rule, [i_0_162, ...])). % 0.17/0.36 # End printing tableau % 0.17/0.36 # SZS output end % 0.17/0.36 # Branches closed with saturation will be marked with an "s" % 0.17/0.36 # Child (17617) has found a proof. % 0.17/0.36 % 0.17/0.36 # Proof search is over... % 0.17/0.36 # Freeing feature tree %------------------------------------------------------------------------------