%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ035-7 : TPTP v8.1.0. Released v2.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 : n029.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 18:11:01 EDT 2022 % Result : Unsatisfiable 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : PUZ035-7 : TPTP v8.1.0. Released v2.0.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n029.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sat May 28 20:31:12 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.12/0.37 # and selection function SelectUnlessUniqMax. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 14 Number of unprocessed: 14 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 14 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 0 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 14 extension rule candidate clauses % 0.12/0.37 # 0 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 13 tableaux to operate on % 0.12/0.38 # There were 4 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 4 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 4 successful branch saturations after the branch. % 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_23, plain, (truth(not(X1))|truth(X1))). % 0.12/0.38 cnf(i_0_24, plain, (~truth(not(X1))|~truth(X1))). % 0.12/0.38 cnf(i_0_16, plain, (~truth(isa(X1,knight))|~truth(isa(X1,knave)))). % 0.12/0.38 cnf(i_0_27, plain, (truth(or(X1,X2))|~truth(X2))). % 0.12/0.38 cnf(i_0_26, plain, (truth(or(X1,X2))|~truth(X1))). % 0.12/0.38 cnf(i_0_15, plain, (truth(isa(X1,knave))|truth(isa(X1,knight)))). % 0.12/0.38 cnf(i_0_25, plain, (truth(X1)|truth(X2)|~truth(or(X1,X2)))). % 0.12/0.38 cnf(i_0_22, plain, (~reply(X1,X2,yes)|~reply(X1,X2,no))). % 0.12/0.38 cnf(i_0_17, plain, (truth(X1)|~reply(X2,X1,yes)|~truth(isa(X2,knight)))). % 0.12/0.38 cnf(i_0_18, plain, (truth(isa(X1,knight))|~reply(X1,X2,yes)|~truth(X2))). % 0.12/0.38 cnf(i_0_19, plain, (reply(X1,X2,yes)|~truth(isa(X1,knight))|~truth(X2))). % 0.12/0.38 cnf(i_0_21, plain, (reply(X1,X2,no)|reply(X1,X2,yes))). % 0.12/0.38 cnf(i_0_28, negated_conjecture, (~reply(asked,or(isa(asked,knight),isa(other,knight)),X1)|~truth(isa(asked,X2))|~truth(isa(other,X3)))). % 0.12/0.38 cnf(i_0_20, plain, (reply(X1,X2,yes)|truth(isa(X1,knight))|truth(X2))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 18 steps % 0.12/0.38 cnf(i_0_28, negated_conjecture, (~reply(asked,or(isa(asked,knight),isa(other,knight)),yes)|~truth(isa(asked,knave))|~truth(isa(other,knight))), inference(start_rule)). % 0.12/0.38 cnf(i_0_29, plain, (~reply(asked,or(isa(asked,knight),isa(other,knight)),yes)), inference(extension_rule, [i_0_20])). % 0.12/0.38 cnf(i_0_61, plain, (truth(isa(asked,knight))), inference(extension_rule, [i_0_24])). % 0.12/0.38 cnf(i_0_187, plain, (~truth(not(isa(asked,knight)))), inference(extension_rule, [i_0_23])). % 0.12/0.38 cnf(i_0_62, plain, (truth(or(isa(asked,knight),isa(other,knight)))), inference(extension_rule, [i_0_27])). % 0.12/0.38 cnf(i_0_193, plain, (truth(or(X7,or(isa(asked,knight),isa(other,knight))))), inference(extension_rule, [i_0_26])). % 0.12/0.38 cnf(i_0_30, plain, (~truth(isa(asked,knave))), inference(extension_rule, [i_0_15])). % 0.12/0.38 cnf(i_0_202, plain, (truth(isa(asked,knight))), inference(extension_rule, [i_0_17])). % 0.12/0.38 cnf(i_0_208, plain, (truth(isa(asked,knave))), inference(closure_rule, [i_0_30])). % 0.12/0.38 cnf(i_0_209, plain, (~reply(asked,isa(asked,knave),yes)), inference(extension_rule, [i_0_21])). % 0.12/0.38 cnf(i_0_31, plain, (~truth(isa(other,knight))), inference(extension_rule, [i_0_25])). % 0.12/0.38 cnf(i_0_227, plain, (truth(isa(other,knight))), inference(closure_rule, [i_0_31])). % 0.12/0.38 cnf(i_0_228, plain, (~truth(or(isa(other,knight),isa(other,knight)))), inference(extension_rule, [i_0_20])). % 0.12/0.38 cnf(i_0_238, plain, (truth(isa(other,knight))), inference(closure_rule, [i_0_31])). % 0.12/0.38 cnf(i_0_189, plain, (truth(not(not(isa(asked,knight))))), inference(etableau_closure_rule, [i_0_189, ...])). % 0.12/0.38 cnf(i_0_197, plain, (truth(or(or(X7,or(isa(asked,knight),isa(other,knight))),X6))), inference(etableau_closure_rule, [i_0_197, ...])). % 0.12/0.38 cnf(i_0_222, plain, (reply(asked,isa(asked,knave),no)), inference(etableau_closure_rule, [i_0_222, ...])). % 0.12/0.38 cnf(i_0_237, plain, (reply(other,or(isa(other,knight),isa(other,knight)),yes)), inference(etableau_closure_rule, [i_0_237, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 4 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 4 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 4 successful branch saturations after the branch. % 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_23, plain, (truth(not(X1))|truth(X1))). % 0.12/0.38 cnf(i_0_24, plain, (~truth(not(X1))|~truth(X1))). % 0.12/0.38 cnf(i_0_16, plain, (~truth(isa(X1,knight))|~truth(isa(X1,knave)))). % 0.12/0.38 cnf(i_0_27, plain, (truth(or(X1,X2))|~truth(X2))). % 0.12/0.38 cnf(i_0_26, plain, (truth(or(X1,X2))|~truth(X1))). % 0.12/0.38 cnf(i_0_15, plain, (truth(isa(X1,knave))|truth(isa(X1,knight)))). % 0.12/0.38 cnf(i_0_25, plain, (truth(X1)|truth(X2)|~truth(or(X1,X2)))). % 0.12/0.38 cnf(i_0_22, plain, (~reply(X1,X2,yes)|~reply(X1,X2,no))). % 0.12/0.38 cnf(i_0_17, plain, (truth(X1)|~reply(X2,X1,yes)|~truth(isa(X2,knight)))). % 0.12/0.38 cnf(i_0_18, plain, (truth(isa(X1,knight))|~reply(X1,X2,yes)|~truth(X2))). % 0.12/0.38 cnf(i_0_19, plain, (reply(X1,X2,yes)|~truth(isa(X1,knight))|~truth(X2))). % 0.12/0.38 cnf(i_0_21, plain, (reply(X1,X2,no)|reply(X1,X2,yes))). % 0.12/0.38 cnf(i_0_28, negated_conjecture, (~reply(asked,or(isa(asked,knight),isa(other,knight)),X1)|~truth(isa(asked,X2))|~truth(isa(other,X3)))). % 0.12/0.38 cnf(i_0_20, plain, (reply(X1,X2,yes)|truth(isa(X1,knight))|truth(X2))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 16 steps % 0.12/0.38 cnf(i_0_28, negated_conjecture, (~reply(asked,or(isa(asked,knight),isa(other,knight)),no)|~truth(isa(asked,knight))|~truth(isa(other,knight))), inference(start_rule)). % 0.12/0.38 cnf(i_0_30, plain, (~truth(isa(asked,knight))), inference(extension_rule, [i_0_15])). % 0.12/0.38 cnf(i_0_76, plain, (truth(isa(asked,knave))), inference(extension_rule, [i_0_24])). % 0.12/0.38 cnf(i_0_102, plain, (~truth(not(isa(asked,knave)))), inference(extension_rule, [i_0_23])). % 0.12/0.38 cnf(i_0_29, plain, (~reply(asked,or(isa(asked,knight),isa(other,knight)),no)), inference(extension_rule, [i_0_21])). % 0.12/0.38 cnf(i_0_129, plain, (reply(asked,or(isa(asked,knight),isa(other,knight)),yes)), inference(extension_rule, [i_0_17])). % 0.12/0.38 cnf(i_0_143, plain, (truth(or(isa(asked,knight),isa(other,knight)))), inference(extension_rule, [i_0_27])). % 0.12/0.38 cnf(i_0_145, plain, (~truth(isa(asked,knight))), inference(extension_rule, [i_0_15])). % 0.12/0.38 cnf(i_0_31, plain, (~truth(isa(other,knight))), inference(extension_rule, [i_0_25])). % 0.12/0.38 cnf(i_0_161, plain, (truth(isa(other,knight))), inference(closure_rule, [i_0_31])). % 0.12/0.38 cnf(i_0_162, plain, (~truth(or(isa(other,knight),isa(other,knight)))), inference(extension_rule, [i_0_20])). % 0.12/0.38 cnf(i_0_176, plain, (truth(isa(other,knight))), inference(closure_rule, [i_0_31])). % 0.12/0.38 cnf(i_0_104, plain, (truth(not(not(isa(asked,knave))))), inference(etableau_closure_rule, [i_0_104, ...])). % 0.12/0.38 cnf(i_0_148, plain, (truth(or(X4,or(isa(asked,knight),isa(other,knight))))), inference(etableau_closure_rule, [i_0_148, ...])). % 0.12/0.38 cnf(i_0_154, plain, (truth(isa(asked,knave))), inference(etableau_closure_rule, [i_0_154, ...])). % 0.12/0.38 cnf(i_0_175, plain, (reply(other,or(isa(other,knight),isa(other,knight)),yes)), inference(etableau_closure_rule, [i_0_175, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Child (19476) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------