TSTP Solution File: PUZ132+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.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 : n028.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:16 EDT 2022
% Result : Theorem 0.11s 0.36s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.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.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun May 29 02:24:48 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.36 # No SInE strategy applied
% 0.11/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.36 #
% 0.11/0.36 # Presaturation interreduction done
% 0.11/0.36 # Number of axioms: 11 Number of unprocessed: 11
% 0.11/0.36 # Tableaux proof search.
% 0.11/0.36 # APR header successfully linked.
% 0.11/0.36 # Hello from C++
% 0.11/0.36 # The folding up rule is enabled...
% 0.11/0.36 # Local unification is enabled...
% 0.11/0.36 # Any saturation attempts will use folding labels...
% 0.11/0.36 # 11 beginning clauses after preprocessing and clausification
% 0.11/0.36 # Creating start rules for all 1 conjectures.
% 0.11/0.36 # There are 1 start rule candidates:
% 0.11/0.36 # Found 6 unit axioms.
% 0.11/0.36 # 1 start rule tableaux created.
% 0.11/0.36 # 5 extension rule candidate clauses
% 0.11/0.36 # 6 unit axiom clauses
% 0.11/0.36
% 0.11/0.36 # Requested 8, 32 cores available to the main process.
% 0.11/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.11/0.36 # Creating equality axioms
% 0.11/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.11/0.36 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.36 # We now have 13 tableaux to operate on
% 0.11/0.36 # There were 1 total branch saturation attempts.
% 0.11/0.36 # There were 0 of these attempts blocked.
% 0.11/0.36 # There were 0 deferred branch saturation attempts.
% 0.11/0.36 # There were 0 free duplicated saturations.
% 0.11/0.36 # There were 1 total successful branch saturations.
% 0.11/0.36 # There were 0 successful branch saturations in interreduction.
% 0.11/0.36 # There were 0 successful branch saturations on the branch.
% 0.11/0.36 # There were 1 successful branch saturations after the branch.
% 0.11/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 # Begin clausification derivation
% 0.11/0.36
% 0.11/0.36 # End clausification derivation
% 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.36 cnf(i_0_5, plain, (capital(washington))).
% 0.11/0.36 cnf(i_0_9, plain, (capital_city(usa)=washington)).
% 0.11/0.36 cnf(i_0_1, plain, (capital(esk1_0))).
% 0.11/0.36 cnf(i_0_2, plain, (city(esk2_0))).
% 0.11/0.36 cnf(i_0_6, plain, (country(usa))).
% 0.11/0.36 cnf(i_0_4, plain, (country(esk3_0))).
% 0.11/0.36 cnf(i_0_11, negated_conjecture, (~beautiful(washington)|~has_crime(washington))).
% 0.11/0.36 cnf(i_0_3, plain, (city(X1)|~capital(X1))).
% 0.11/0.36 cnf(i_0_8, plain, (has_crime(X1)|~city(X1))).
% 0.11/0.36 cnf(i_0_7, plain, (capital(capital_city(X1))|~country(X1))).
% 0.11/0.36 cnf(i_0_10, plain, (beautiful(capital_city(X1))|~country(X1))).
% 0.11/0.36 cnf(i_0_44, plain, (X10=X10)).
% 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.36 # Begin printing tableau
% 0.11/0.36 # Found 5 steps
% 0.11/0.36 cnf(i_0_5, plain, (capital(washington)), inference(start_rule)).
% 0.11/0.36 cnf(i_0_54, plain, (capital(washington)), inference(extension_rule, [i_0_48])).
% 0.11/0.36 cnf(i_0_89, plain, (capital_city(usa)!=washington), inference(closure_rule, [i_0_9])).
% 0.11/0.36 cnf(i_0_88, plain, (capital(capital_city(usa))), inference(extension_rule, [i_0_3])).
% 0.11/0.36 cnf(i_0_105, plain, (city(capital_city(usa))), inference(etableau_closure_rule, [i_0_105, ...])).
% 0.11/0.36 # End printing tableau
% 0.11/0.36 # SZS output end
% 0.11/0.36 # Branches closed with saturation will be marked with an "s"
% 0.11/0.36 # There were 1 total branch saturation attempts.
% 0.11/0.36 # There were 0 of these attempts blocked.
% 0.11/0.36 # There were 0 deferred branch saturation attempts.
% 0.11/0.36 # There were 0 free duplicated saturations.
% 0.11/0.36 # There were 1 total successful branch saturations.
% 0.11/0.36 # There were 0 successful branch saturations in interreduction.
% 0.11/0.36 # There were 0 successful branch saturations on the branch.
% 0.11/0.36 # There were 1 successful branch saturations after the branch.
% 0.11/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 # Begin clausification derivation
% 0.11/0.36
% 0.11/0.36 # End clausification derivation
% 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.36 cnf(i_0_5, plain, (capital(washington))).
% 0.11/0.36 cnf(i_0_9, plain, (capital_city(usa)=washington)).
% 0.11/0.36 cnf(i_0_1, plain, (capital(esk1_0))).
% 0.11/0.36 cnf(i_0_2, plain, (city(esk2_0))).
% 0.11/0.36 cnf(i_0_6, plain, (country(usa))).
% 0.11/0.36 cnf(i_0_4, plain, (country(esk3_0))).
% 0.11/0.36 cnf(i_0_11, negated_conjecture, (~beautiful(washington)|~has_crime(washington))).
% 0.11/0.36 cnf(i_0_3, plain, (city(X1)|~capital(X1))).
% 0.11/0.36 cnf(i_0_8, plain, (has_crime(X1)|~city(X1))).
% 0.11/0.36 cnf(i_0_7, plain, (capital(capital_city(X1))|~country(X1))).
% 0.11/0.36 cnf(i_0_10, plain, (beautiful(capital_city(X1))|~country(X1))).
% 0.11/0.36 cnf(i_0_44, plain, (X10=X10)).
% 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.36 # Begin printing tableau
% 0.11/0.36 # Found 4 steps
% 0.11/0.36 cnf(i_0_5, plain, (capital(washington)), inference(start_rule)).
% 0.11/0.36 cnf(i_0_54, plain, (capital(washington)), inference(extension_rule, [i_0_3])).
% 0.11/0.36 cnf(i_0_71, plain, (city(washington)), inference(extension_rule, [i_0_8])).
% 0.11/0.36 cnf(i_0_107, plain, (has_crime(washington)), inference(etableau_closure_rule, [i_0_107, ...])).
% 0.11/0.36 # End printing tableau
% 0.11/0.36 # SZS output end
% 0.11/0.36 # Branches closed with saturation will be marked with an "s"
% 0.11/0.36 # Child (30272) has found a proof.
% 0.11/0.36
% 0.11/0.36 # Proof search is over...
% 0.11/0.36 # Freeing feature tree
%------------------------------------------------------------------------------