%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ035-1 : 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 : n032.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.15s 0.33s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.10 % Problem : PUZ035-1 : TPTP v8.1.0. Released v2.0.0. % 0.08/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.29 % Computer : n032.cluster.edu % 0.10/0.29 % Model : x86_64 x86_64 % 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.29 % Memory : 8042.1875MB % 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.30 % CPULimit : 300 % 0.10/0.30 % WCLimit : 600 % 0.10/0.30 % DateTime : Sat May 28 22:05:10 EDT 2022 % 0.10/0.30 % CPUTime : % 0.15/0.32 # No SInE strategy applied % 0.15/0.32 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.32 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.32 # % 0.15/0.32 # Presaturation interreduction done % 0.15/0.32 # Number of axioms: 15 Number of unprocessed: 15 % 0.15/0.32 # Tableaux proof search. % 0.15/0.32 # APR header successfully linked. % 0.15/0.32 # Hello from C++ % 0.15/0.32 # The folding up rule is enabled... % 0.15/0.32 # Local unification is enabled... % 0.15/0.32 # Any saturation attempts will use folding labels... % 0.15/0.32 # 15 beginning clauses after preprocessing and clausification % 0.15/0.32 # Creating start rules for all 1 conjectures. % 0.15/0.32 # There are 1 start rule candidates: % 0.15/0.32 # Found 2 unit axioms. % 0.15/0.32 # 1 start rule tableaux created. % 0.15/0.32 # 13 extension rule candidate clauses % 0.15/0.32 # 2 unit axiom clauses % 0.15/0.32 % 0.15/0.32 # Requested 8, 32 cores available to the main process. % 0.15/0.32 # There are not enough tableaux to fork, creating more from the initial 1 % 0.15/0.32 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.15/0.32 # We now have 9 tableaux to operate on % 0.15/0.33 # Ran out of tableaux, making start rules for all clauses % 0.15/0.33 # Ran out of tableaux, making start rules for all clauses % 0.15/0.33 # There were 4 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 4 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 4 successful branch saturations after the branch. % 0.15/0.33 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_28, plain, (person(asked))). % 0.15/0.33 cnf(i_0_29, plain, (person(other))). % 0.15/0.33 cnf(i_0_27, plain, (response(no)|response(yes))). % 0.15/0.33 cnf(i_0_20, plain, (~lies(X1)|~tell_the_truth(X1))). % 0.15/0.33 cnf(i_0_17, plain, (~isa(X1,knight)|~isa(X1,knave))). % 0.15/0.33 cnf(i_0_18, plain, (tell_the_truth(X1)|~isa(X1,knight))). % 0.15/0.33 cnf(i_0_19, plain, (lies(X1)|~isa(X1,knave))). % 0.15/0.33 cnf(i_0_24, plain, (~response(no)|~tell_the_truth(asked)|~isa(X1,knight))). % 0.15/0.33 cnf(i_0_23, plain, (~response(yes)|~lies(asked)|~isa(X1,knight))). % 0.15/0.33 cnf(i_0_30, negated_conjecture, (~response(X1)|~isa(asked,X2)|~isa(other,X3))). % 0.15/0.33 cnf(i_0_25, plain, (response(yes)|~tell_the_truth(asked)|~isa(X1,knight))). % 0.15/0.33 cnf(i_0_16, plain, (isa(X1,knave)|isa(X1,knight)|~person(X1))). % 0.15/0.33 cnf(i_0_21, plain, (isa(other,knight)|isa(asked,knight)|~response(yes)|~tell_the_truth(asked))). % 0.15/0.33 cnf(i_0_22, plain, (isa(other,knight)|isa(asked,knight)|~response(no)|~lies(asked))). % 0.15/0.33 cnf(i_0_26, plain, (response(no)|isa(other,knight)|isa(asked,knight)|~tell_the_truth(asked))). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 16 steps % 0.15/0.33 cnf(i_0_30, negated_conjecture, (~response(no)|~isa(asked,knight)|~isa(other,knave)), inference(start_rule)). % 0.15/0.33 cnf(i_0_32, plain, (~isa(asked,knight)), inference(extension_rule, [i_0_16])). % 0.15/0.33 cnf(i_0_92, plain, (~person(asked)), inference(closure_rule, [i_0_28])). % 0.15/0.33 cnf(i_0_90, plain, (isa(asked,knave)), inference(extension_rule, [i_0_19])). % 0.15/0.33 cnf(i_0_116, plain, (lies(asked)), inference(extension_rule, [i_0_20])). % 0.15/0.33 cnf(i_0_31, plain, (~response(no)), inference(extension_rule, [i_0_27])). % 0.15/0.33 cnf(i_0_123, plain, (response(yes)), inference(extension_rule, [i_0_23])). % 0.15/0.33 cnf(i_0_132, plain, (~lies(asked)), inference(extension_rule, [i_0_19])). % 0.15/0.33 cnf(i_0_133, plain, (~isa(asked,knight)), inference(extension_rule, [i_0_16])). % 0.15/0.33 cnf(i_0_176, plain, (~person(asked)), inference(closure_rule, [i_0_28])). % 0.15/0.33 cnf(i_0_33, plain, (~isa(other,knave)), inference(extension_rule, [i_0_16])). % 0.15/0.33 cnf(i_0_213, plain, (~person(other)), inference(closure_rule, [i_0_29])). % 0.15/0.33 cnf(i_0_121, plain, (~tell_the_truth(asked)), inference(etableau_closure_rule, [i_0_121, ...])). % 0.15/0.33 cnf(i_0_163, plain, (~isa(asked,knave)), inference(etableau_closure_rule, [i_0_163, ...])). % 0.15/0.33 cnf(i_0_174, plain, (isa(asked,knave)), inference(etableau_closure_rule, [i_0_174, ...])). % 0.15/0.33 cnf(i_0_212, plain, (isa(other,knight)), inference(etableau_closure_rule, [i_0_212, ...])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # There were 5 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 5 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 5 successful branch saturations after the branch. % 0.15/0.33 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_28, plain, (person(asked))). % 0.15/0.33 cnf(i_0_29, plain, (person(other))). % 0.15/0.33 cnf(i_0_27, plain, (response(no)|response(yes))). % 0.15/0.33 cnf(i_0_20, plain, (~lies(X1)|~tell_the_truth(X1))). % 0.15/0.33 cnf(i_0_17, plain, (~isa(X1,knight)|~isa(X1,knave))). % 0.15/0.33 cnf(i_0_18, plain, (tell_the_truth(X1)|~isa(X1,knight))). % 0.15/0.33 cnf(i_0_19, plain, (lies(X1)|~isa(X1,knave))). % 0.15/0.33 cnf(i_0_24, plain, (~response(no)|~tell_the_truth(asked)|~isa(X1,knight))). % 0.15/0.33 cnf(i_0_23, plain, (~response(yes)|~lies(asked)|~isa(X1,knight))). % 0.15/0.33 cnf(i_0_30, negated_conjecture, (~response(X1)|~isa(asked,X2)|~isa(other,X3))). % 0.15/0.33 cnf(i_0_25, plain, (response(yes)|~tell_the_truth(asked)|~isa(X1,knight))). % 0.15/0.33 cnf(i_0_16, plain, (isa(X1,knave)|isa(X1,knight)|~person(X1))). % 0.15/0.33 cnf(i_0_21, plain, (isa(other,knight)|isa(asked,knight)|~response(yes)|~tell_the_truth(asked))). % 0.15/0.33 cnf(i_0_22, plain, (isa(other,knight)|isa(asked,knight)|~response(no)|~lies(asked))). % 0.15/0.33 cnf(i_0_26, plain, (response(no)|isa(other,knight)|isa(asked,knight)|~tell_the_truth(asked))). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 9 steps % 0.15/0.33 cnf(i_0_26, plain, (response(no)|isa(other,knight)|isa(asked,knight)|~tell_the_truth(asked)), inference(start_rule)). % 0.15/0.33 cnf(i_0_468, plain, (response(no)), inference(extension_rule, [i_0_30])). % 0.15/0.33 cnf(i_0_507, plain, (~isa(asked,knave)), inference(extension_rule, [i_0_16])). % 0.15/0.33 cnf(i_0_523, plain, (~person(asked)), inference(closure_rule, [i_0_28])). % 0.15/0.33 cnf(i_0_469, plain, (isa(other,knight)), inference(etableau_closure_rule, [i_0_469, ...])). % 0.15/0.33 cnf(i_0_470, plain, (isa(asked,knight)), inference(etableau_closure_rule, [i_0_470, ...])). % 0.15/0.33 cnf(i_0_471, plain, (~tell_the_truth(asked)), inference(etableau_closure_rule, [i_0_471, ...])). % 0.15/0.33 cnf(i_0_508, plain, (~isa(other,X6)), inference(etableau_closure_rule, [i_0_508, ...])). % 0.15/0.33 cnf(i_0_522, plain, (isa(asked,knight)), inference(etableau_closure_rule, [i_0_522, ...])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # Child (6991) has found a proof. % 0.15/0.33 % 0.15/0.33 # Proof search is over... % 0.15/0.33 # Freeing feature tree %------------------------------------------------------------------------------