%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ021-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 : n019.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:10:58 EDT 2022 % Result : Unsatisfiable 0.19s 0.44s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : PUZ021-1 : TPTP v8.1.0. Released v1.0.0. % 0.03/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.33 % Computer : n019.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sat May 28 21:43:10 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.19/0.36 # and selection function SelectUnlessUniqMax. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 13 Number of unprocessed: 13 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 13 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 2 conjectures. % 0.19/0.36 # There are 2 start rule candidates: % 0.19/0.36 # Found 0 unit axioms. % 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.36 # 2 start rule tableaux created. % 0.19/0.36 # 13 extension rule candidate clauses % 0.19/0.36 # 0 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.19/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 9 tableaux to operate on % 0.19/0.44 # There were 2 total branch saturation attempts. % 0.19/0.44 # There were 0 of these attempts blocked. % 0.19/0.44 # There were 0 deferred branch saturation attempts. % 0.19/0.44 # There were 0 free duplicated saturations. % 0.19/0.44 # There were 2 total successful branch saturations. % 0.19/0.44 # There were 1 successful branch saturations in interreduction. % 0.19/0.44 # There were 0 successful branch saturations on the branch. % 0.19/0.44 # There were 1 successful branch saturations after the branch. % 0.19/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.44 # Begin clausification derivation % 0.19/0.44 % 0.19/0.44 # End clausification derivation % 0.19/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.44 cnf(i_0_26, negated_conjecture, (says(me,X1)|a_truth(and(knave(me),rich(me)),X1))). % 0.19/0.44 cnf(i_0_25, negated_conjecture, (~says(me,X1)|~a_truth(and(knave(me),rich(me)),X1))). % 0.19/0.44 cnf(i_0_14, plain, (~a_truth(knight(X1),X2)|~a_truth(knave(X1),X2))). % 0.19/0.44 cnf(i_0_16, plain, (~a_truth(rich(X1),X2)|~a_truth(poor(X1),X2))). % 0.19/0.44 cnf(i_0_23, plain, (a_truth(X1,X2)|~a_truth(and(X3,X1),X2))). % 0.19/0.44 cnf(i_0_15, plain, (a_truth(knave(X1),X2)|a_truth(knight(X1),X2))). % 0.19/0.44 cnf(i_0_17, plain, (a_truth(poor(X1),X2)|a_truth(rich(X1),X2))). % 0.19/0.44 cnf(i_0_22, plain, (a_truth(X1,X2)|~a_truth(and(X1,X3),X2))). % 0.19/0.44 cnf(i_0_20, plain, (~says(X1,X2)|~a_truth(knave(X1),X3)|~a_truth(X2,X3))). % 0.19/0.44 cnf(i_0_18, plain, (a_truth(X1,X2)|~says(X3,X1)|~a_truth(knight(X3),X2))). % 0.19/0.44 cnf(i_0_19, plain, (says(X1,X2)|~a_truth(knight(X1),X3)|~a_truth(X2,X3))). % 0.19/0.44 cnf(i_0_24, plain, (a_truth(and(X1,X2),X3)|~a_truth(X2,X3)|~a_truth(X1,X3))). % 0.19/0.44 cnf(i_0_21, plain, (says(X1,X2)|a_truth(X2,X3)|~a_truth(knave(X1),X3))). % 0.19/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.44 # Begin printing tableau % 0.19/0.44 # Found 10 steps % 0.19/0.44 cnf(i_0_25, negated_conjecture, (~says(me,knight(me))|~a_truth(and(knave(me),rich(me)),knight(me))), inference(start_rule)). % 0.19/0.44 cnf(i_0_27, plain, (~says(me,knight(me))), inference(extension_rule, [i_0_21])). % 0.19/0.44 cnf(i_0_56, plain, (a_truth(knight(me),X8)), inference(extension_rule, [i_0_14])). % 0.19/0.44 cnf(i_0_125, plain, (~a_truth(knave(me),X8)), inference(extension_rule, [i_0_23])). % 0.19/0.44 cnf(i_0_57, plain, (~a_truth(knave(me),X8)), inference(extension_rule, [i_0_15])). % 0.19/0.44 cnf(i_0_133, plain, (a_truth(knight(me),X8)), inference(extension_rule, [i_0_19])). % 0.19/0.44 cnf(i_0_5109, plain, (says(me,knight(me))), inference(closure_rule, [i_0_27])). % 0.19/0.44 cnf(i_0_5111, plain, (~a_truth(knight(me),X8)), inference(closure_rule, [i_0_133])). % 0.19/0.44 cnf(i_0_129, plain, (~a_truth(and(X7,knave(me)),X8)), inference(etableau_closure_rule, [i_0_129, ...])). % 0.19/0.44 cnf(i_0_28, plain, (~a_truth(and(knave(me),rich(me)),knight(me))), inference(etableau_closure_rule, [i_0_28, ...])). % 0.19/0.44 # End printing tableau % 0.19/0.44 # SZS output end % 0.19/0.44 # Branches closed with saturation will be marked with an "s" % 0.19/0.44 # Child (19405) has found a proof. % 0.19/0.44 % 0.19/0.44 # Proof search is over... % 0.19/0.44 # Freeing feature tree %------------------------------------------------------------------------------