TSTP Solution File: PUZ001-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ001-2 : 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 : n021.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:55 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.10/0.12 % Problem : PUZ001-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/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 : n021.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:51:57 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: 15 Number of unprocessed: 15
% 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 # 15 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 8 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 7 extension rule candidate clauses
% 0.12/0.36 # 8 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 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 17 tableaux to operate on
% 0.12/0.37 # There were 1 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 1 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 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/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_18, plain, (lives_at_dreadsbury(aunt_agatha))).
% 0.12/0.37 cnf(i_0_17, plain, (killed(someone,aunt_agatha))).
% 0.12/0.37 cnf(i_0_16, plain, (lives_at_dreadsbury(someone))).
% 0.12/0.37 cnf(i_0_19, plain, (lives_at_dreadsbury(butler))).
% 0.12/0.37 cnf(i_0_20, plain, (lives_at_dreadsbury(charles))).
% 0.12/0.37 cnf(i_0_29, plain, (butler!=aunt_agatha)).
% 0.12/0.37 cnf(i_0_30, negated_conjecture, (~killed(aunt_agatha,aunt_agatha))).
% 0.12/0.37 cnf(i_0_28, plain, (~hates(X1,every_one_but(X1)))).
% 0.12/0.37 cnf(i_0_23, plain, (~richer(X1,X2)|~killed(X1,X2))).
% 0.12/0.37 cnf(i_0_24, plain, (~hates(aunt_agatha,X1)|~hates(charles,X1))).
% 0.12/0.37 cnf(i_0_22, plain, (hates(X1,X2)|~killed(X1,X2))).
% 0.12/0.37 cnf(i_0_25, plain, (X1=butler|hates(aunt_agatha,X1))).
% 0.12/0.37 cnf(i_0_27, plain, (hates(butler,X1)|~hates(aunt_agatha,X1))).
% 0.12/0.37 cnf(i_0_26, plain, (richer(X1,aunt_agatha)|hates(butler,X1))).
% 0.12/0.37 cnf(i_0_21, plain, (X1=charles|X1=butler|X1=aunt_agatha|~lives_at_dreadsbury(X1))).
% 0.12/0.37 cnf(i_0_48, plain, (X3=X3)).
% 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 4 steps
% 0.12/0.37 cnf(i_0_17, plain, (killed(someone,aunt_agatha)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_58, plain, (killed(someone,aunt_agatha)), inference(extension_rule, [i_0_23])).
% 0.12/0.37 cnf(i_0_122, plain, (~richer(someone,aunt_agatha)), inference(extension_rule, [i_0_26])).
% 0.12/0.37 cnf(i_0_133, plain, (hates(butler,someone)), inference(etableau_closure_rule, [i_0_133, ...])).
% 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 # There were 1 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 1 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 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/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_18, plain, (lives_at_dreadsbury(aunt_agatha))).
% 0.12/0.37 cnf(i_0_17, plain, (killed(someone,aunt_agatha))).
% 0.12/0.37 cnf(i_0_16, plain, (lives_at_dreadsbury(someone))).
% 0.12/0.37 cnf(i_0_19, plain, (lives_at_dreadsbury(butler))).
% 0.12/0.37 cnf(i_0_20, plain, (lives_at_dreadsbury(charles))).
% 0.12/0.37 cnf(i_0_29, plain, (butler!=aunt_agatha)).
% 0.12/0.37 cnf(i_0_30, negated_conjecture, (~killed(aunt_agatha,aunt_agatha))).
% 0.12/0.37 cnf(i_0_28, plain, (~hates(X1,every_one_but(X1)))).
% 0.12/0.37 cnf(i_0_23, plain, (~richer(X1,X2)|~killed(X1,X2))).
% 0.12/0.37 cnf(i_0_24, plain, (~hates(aunt_agatha,X1)|~hates(charles,X1))).
% 0.12/0.37 cnf(i_0_22, plain, (hates(X1,X2)|~killed(X1,X2))).
% 0.12/0.37 cnf(i_0_25, plain, (X1=butler|hates(aunt_agatha,X1))).
% 0.12/0.37 cnf(i_0_27, plain, (hates(butler,X1)|~hates(aunt_agatha,X1))).
% 0.12/0.37 cnf(i_0_26, plain, (richer(X1,aunt_agatha)|hates(butler,X1))).
% 0.12/0.37 cnf(i_0_21, plain, (X1=charles|X1=butler|X1=aunt_agatha|~lives_at_dreadsbury(X1))).
% 0.12/0.37 cnf(i_0_48, plain, (X3=X3)).
% 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 4 steps
% 0.12/0.37 cnf(i_0_29, plain, (butler!=aunt_agatha), inference(start_rule)).
% 0.12/0.37 cnf(i_0_62, plain, (butler!=aunt_agatha), inference(extension_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_129, plain, (hates(aunt_agatha,aunt_agatha)), inference(extension_rule, [i_0_24])).
% 0.12/0.37 cnf(i_0_133, plain, (~hates(charles,aunt_agatha)), inference(etableau_closure_rule, [i_0_133, ...])).
% 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 # There were 2 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 2 total successful branch saturations.
% 0.12/0.37 # There were 1 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/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_18, plain, (lives_at_dreadsbury(aunt_agatha))).
% 0.12/0.37 cnf(i_0_17, plain, (killed(someone,aunt_agatha))).
% 0.12/0.37 cnf(i_0_16, plain, (lives_at_dreadsbury(someone))).
% 0.12/0.37 cnf(i_0_19, plain, (lives_at_dreadsbury(butler))).
% 0.12/0.37 cnf(i_0_20, plain, (lives_at_dreadsbury(charles))).
% 0.12/0.37 cnf(i_0_29, plain, (butler!=aunt_agatha)).
% 0.12/0.37 cnf(i_0_30, negated_conjecture, (~killed(aunt_agatha,aunt_agatha))).
% 0.12/0.37 cnf(i_0_28, plain, (~hates(X1,every_one_but(X1)))).
% 0.12/0.37 cnf(i_0_23, plain, (~richer(X1,X2)|~killed(X1,X2))).
% 0.12/0.37 cnf(i_0_24, plain, (~hates(aunt_agatha,X1)|~hates(charles,X1))).
% 0.12/0.37 cnf(i_0_22, plain, (hates(X1,X2)|~killed(X1,X2))).
% 0.12/0.37 cnf(i_0_25, plain, (X1=butler|hates(aunt_agatha,X1))).
% 0.12/0.37 cnf(i_0_27, plain, (hates(butler,X1)|~hates(aunt_agatha,X1))).
% 0.12/0.37 cnf(i_0_26, plain, (richer(X1,aunt_agatha)|hates(butler,X1))).
% 0.12/0.37 cnf(i_0_21, plain, (X1=charles|X1=butler|X1=aunt_agatha|~lives_at_dreadsbury(X1))).
% 0.12/0.37 cnf(i_0_48, plain, (X3=X3)).
% 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 7 steps
% 0.12/0.37 cnf(i_0_18, plain, (lives_at_dreadsbury(aunt_agatha)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_57, plain, (lives_at_dreadsbury(aunt_agatha)), inference(extension_rule, [i_0_52])).
% 0.12/0.37 cnf(i_0_105, plain, (lives_at_dreadsbury(aunt_agatha)), inference(extension_rule, [i_0_21])).
% 0.12/0.37 cnf(i_0_106, plain, ($false), inference(closure_rule, [i_0_48])).
% 0.12/0.37 cnf(i_0_135, plain, (aunt_agatha=butler), inference(closure_rule, [i_0_29])).
% 0.12/0.37 cnf(i_0_134, plain, (aunt_agatha=charles), inference(etableau_closure_rule, [i_0_134, ...])).
% 0.12/0.37 cnf(i_0_136, plain, (aunt_agatha=aunt_agatha), inference(etableau_closure_rule, [i_0_136, ...])).
% 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 (15285) has found a proof.
% 0.12/0.37
% 0.12/0.37 # There were 2 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 2 total successful branch saturations.
% 0.12/0.37 # There were 1 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------