TSTP Solution File: CAT001-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CAT001-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 : n018.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 : Thu Jul 14 23:59:52 EDT 2022
% Result : Unsatisfiable 1.99s 2.21s
% Output : CNFRefutation 1.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : CAT001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.31 % Computer : n018.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Sun May 29 22:57:11 EDT 2022
% 0.12/0.31 % CPUTime :
% 0.17/0.34 # No SInE strategy applied
% 0.17/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.17/0.34 # and selection function SelectCQIPrecWNTNp.
% 0.17/0.34 #
% 0.17/0.34 # Presaturation interreduction done
% 0.17/0.34 # Number of axioms: 23 Number of unprocessed: 23
% 0.17/0.34 # Tableaux proof search.
% 0.17/0.34 # APR header successfully linked.
% 0.17/0.34 # Hello from C++
% 0.62/0.81 # The folding up rule is enabled...
% 0.62/0.81 # Local unification is enabled...
% 0.62/0.81 # Any saturation attempts will use folding labels...
% 0.62/0.81 # 23 beginning clauses after preprocessing and clausification
% 0.62/0.81 # Creating start rules for all 1 conjectures.
% 0.62/0.81 # There are 1 start rule candidates:
% 0.62/0.81 # Found 10 unit axioms.
% 0.62/0.81 # 1 start rule tableaux created.
% 0.62/0.81 # 13 extension rule candidate clauses
% 0.62/0.81 # 10 unit axiom clauses
% 0.62/0.81
% 0.62/0.81 # Requested 8, 32 cores available to the main process.
% 0.62/0.81 # There are not enough tableaux to fork, creating more from the initial 1
% 1.99/2.21 # There were 5 total branch saturation attempts.
% 1.99/2.21 # There were 0 of these attempts blocked.
% 1.99/2.21 # There were 0 deferred branch saturation attempts.
% 1.99/2.21 # There were 0 free duplicated saturations.
% 1.99/2.21 # There were 4 total successful branch saturations.
% 1.99/2.21 # There were 0 successful branch saturations in interreduction.
% 1.99/2.21 # There were 0 successful branch saturations on the branch.
% 1.99/2.21 # There were 4 successful branch saturations after the branch.
% 1.99/2.21 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.99/2.21 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.99/2.21 # Begin clausification derivation
% 1.99/2.21
% 1.99/2.21 # End clausification derivation
% 1.99/2.21 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.99/2.21 cnf(i_0_33, plain, (identity_map(domain(X1)))).
% 1.99/2.21 cnf(i_0_34, plain, (identity_map(codomain(X1)))).
% 1.99/2.21 cnf(i_0_44, hypothesis, (product(b,h,d))).
% 1.99/2.21 cnf(i_0_45, hypothesis, (product(b,g,d))).
% 1.99/2.21 cnf(i_0_35, plain, (defined(X1,domain(X1)))).
% 1.99/2.21 cnf(i_0_36, plain, (defined(codomain(X1),X1))).
% 1.99/2.21 cnf(i_0_42, hypothesis, (product(a,b,c))).
% 1.99/2.21 cnf(i_0_37, plain, (product(X1,domain(X1),X1))).
% 1.99/2.21 cnf(i_0_38, plain, (product(codomain(X1),X1,X1))).
% 1.99/2.21 cnf(i_0_46, negated_conjecture, (g!=h)).
% 1.99/2.21 cnf(i_0_25, plain, (defined(X1,X2)|~product(X1,X2,X3))).
% 1.99/2.21 cnf(i_0_24, plain, (product(X1,X2,compose(X1,X2))|~defined(X1,X2))).
% 1.99/2.21 cnf(i_0_43, hypothesis, (X1=X2|~product(c,X2,X3)|~product(c,X1,X3))).
% 1.99/2.21 cnf(i_0_41, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 1.99/2.21 cnf(i_0_39, plain, (product(X1,X2,X2)|~identity_map(X1)|~defined(X1,X2))).
% 1.99/2.21 cnf(i_0_40, plain, (product(X1,X2,X1)|~identity_map(X2)|~defined(X1,X2))).
% 1.99/2.21 cnf(i_0_32, plain, (defined(X1,X2)|~identity_map(X3)|~defined(X3,X2)|~defined(X1,X3))).
% 1.99/2.21 cnf(i_0_29, plain, (defined(X1,X2)|~product(X2,X3,X4)|~defined(X1,X4))).
% 1.99/2.21 cnf(i_0_26, plain, (defined(X1,X2)|~product(X3,X1,X4)|~defined(X4,X2))).
% 1.99/2.21 cnf(i_0_30, plain, (defined(X1,X2)|~product(X3,X4,X1)|~product(X4,X2,X5)|~defined(X3,X5))).
% 1.99/2.21 cnf(i_0_27, plain, (defined(X1,X2)|~product(X3,X4,X2)|~product(X1,X3,X5)|~defined(X5,X4))).
% 1.99/2.21 cnf(i_0_31, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X1)|~product(X6,X2,X5))).
% 1.99/2.21 cnf(i_0_28, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 1.99/2.21 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.99/2.21 # Begin printing tableau
% 1.99/2.21 # Found 10 steps
% 1.99/2.21 cnf(i_0_46, negated_conjecture, (g!=h), inference(start_rule)).
% 1.99/2.21 cnf(i_0_47, plain, (g!=h), inference(extension_rule, [i_0_41])).
% 1.99/2.21 cnf(i_0_56, plain, (~product(h,domain(h),h)), inference(closure_rule, [i_0_37])).
% 1.99/2.21 cnf(i_0_57, plain, (~product(h,domain(h),g)), inference(extension_rule, [i_0_28])).
% 1.99/2.21 cnf(i_0_129, plain, (~product(g,domain(g),g)), inference(closure_rule, [i_0_37])).
% 1.99/2.21 cnf(i_0_131, plain, (~product(h,domain(domain(g)),g)), inference(extension_rule, [i_0_31])).
% 1.99/2.21 cnf(i_0_84968, plain, (~product(g,domain(g),g)), inference(closure_rule, [i_0_37])).
% 1.99/2.21 cnf(i_0_84970, plain, (~product(domain(g),domain(domain(g)),domain(g))), inference(closure_rule, [i_0_37])).
% 1.99/2.21 cnf(i_0_130, plain, (~product(domain(domain(g)),domain(g),domain(h))), inference(etableau_closure_rule, [i_0_130, ...])).
% 1.99/2.21 cnf(i_0_84969, plain, (~product(g,domain(g),h)), inference(etableau_closure_rule, [i_0_84969, ...])).
% 1.99/2.21 # End printing tableau
% 1.99/2.21 # SZS output end
% 1.99/2.21 # Branches closed with saturation will be marked with an "s"
% 1.99/2.21 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux.
% 1.99/2.21 # We now have 6 tableaux to operate on
% 1.99/2.21 # Found closed tableau during pool population.
% 1.99/2.21 # Proof search is over...
% 1.99/2.21 # Freeing feature tree
%------------------------------------------------------------------------------