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