TSTP Solution File: CAT008-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CAT008-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 : n022.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:54 EDT 2022
% Result : Unsatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : CAT008-1 : TPTP v8.1.0. Released v1.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.13/0.33 % Computer : n022.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 : Sun May 29 20:23:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S
% 0.13/0.36 # and selection function SelectComplexG.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 20 Number of unprocessed: 20
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 20 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 1 conjectures.
% 0.13/0.38 # There are 1 start rule candidates:
% 0.13/0.38 # Found 8 unit axioms.
% 0.13/0.38 # 1 start rule tableaux created.
% 0.13/0.38 # 12 extension rule candidate clauses
% 0.13/0.38 # 8 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.38 # There were 2 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 2 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 2 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_39, hypothesis, (defined(a,b))).
% 0.13/0.38 cnf(i_0_30, plain, (identity_map(domain(X1)))).
% 0.13/0.38 cnf(i_0_31, plain, (identity_map(codomain(X1)))).
% 0.13/0.38 cnf(i_0_32, plain, (defined(X1,domain(X1)))).
% 0.13/0.38 cnf(i_0_33, plain, (defined(codomain(X1),X1))).
% 0.13/0.38 cnf(i_0_34, plain, (product(X1,domain(X1),X1))).
% 0.13/0.38 cnf(i_0_35, plain, (product(codomain(X1),X1,X1))).
% 0.13/0.38 cnf(i_0_40, negated_conjecture, (domain(a)!=codomain(b))).
% 0.13/0.38 cnf(i_0_22, plain, (defined(X1,X2)|~product(X1,X2,X3))).
% 0.13/0.38 cnf(i_0_36, plain, (product(X1,X2,X2)|~identity_map(X1)|~defined(X1,X2))).
% 0.13/0.38 cnf(i_0_37, plain, (product(X1,X2,X1)|~identity_map(X2)|~defined(X1,X2))).
% 0.13/0.38 cnf(i_0_21, plain, (product(X1,X2,compose(X1,X2))|~defined(X1,X2))).
% 0.13/0.38 cnf(i_0_38, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.13/0.38 cnf(i_0_26, plain, (defined(X1,X2)|~product(X2,X3,X4)|~defined(X1,X4))).
% 0.13/0.38 cnf(i_0_23, plain, (defined(X1,X2)|~product(X3,X1,X4)|~defined(X4,X2))).
% 0.13/0.38 cnf(i_0_29, plain, (defined(X1,X2)|~identity_map(X3)|~defined(X3,X2)|~defined(X1,X3))).
% 0.13/0.38 cnf(i_0_27, plain, (defined(X1,X2)|~product(X3,X4,X1)|~product(X4,X2,X5)|~defined(X3,X5))).
% 0.13/0.38 cnf(i_0_24, plain, (defined(X1,X2)|~product(X3,X4,X2)|~product(X1,X3,X5)|~defined(X5,X4))).
% 0.13/0.38 cnf(i_0_28, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X1)|~product(X6,X2,X5))).
% 0.13/0.38 cnf(i_0_25, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 9 steps
% 0.13/0.38 cnf(i_0_40, negated_conjecture, (domain(a)!=codomain(b)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_41, plain, (domain(a)!=codomain(b)), inference(extension_rule, [i_0_38])).
% 0.13/0.38 cnf(i_0_53, plain, (~product(codomain(b),domain(codomain(b)),codomain(b))), inference(closure_rule, [i_0_34])).
% 0.13/0.38 cnf(i_0_54, plain, (~product(codomain(b),domain(codomain(b)),domain(a))), inference(extension_rule, [i_0_25])).
% 0.13/0.38 cnf(i_0_117, plain, (~product(domain(a),domain(domain(a)),domain(a))), inference(closure_rule, [i_0_34])).
% 0.13/0.38 cnf(i_0_119, plain, (~product(codomain(b),domain(a),domain(a))), inference(extension_rule, [i_0_36])).
% 0.13/0.38 cnf(i_0_162, plain, (~identity_map(codomain(b))), inference(closure_rule, [i_0_31])).
% 0.13/0.38 cnf(i_0_118, plain, (~product(domain(a),domain(domain(a)),domain(codomain(b)))), inference(etableau_closure_rule, [i_0_118, ...])).
% 0.13/0.38 cnf(i_0_163, plain, (~defined(codomain(b),domain(a))), inference(etableau_closure_rule, [i_0_163, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 4 tableaux to operate on
% 0.13/0.38 # Found closed tableau during pool population.
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------