TSTP Solution File: CAT010-4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CAT010-4 : 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:55 EDT 2022
% Result : Unsatisfiable 0.18s 0.37s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : CAT010-4 : 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.12/0.33 % Computer : n022.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 17:50:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.18/0.36 # and selection function SelectCQArEqLast.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 13 Number of unprocessed: 13
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 13 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 1 conjectures.
% 0.18/0.36 # There are 1 start rule candidates:
% 0.18/0.36 # Found 5 unit axioms.
% 0.18/0.36 # 1 start rule tableaux created.
% 0.18/0.36 # 8 extension rule candidate clauses
% 0.18/0.36 # 5 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.36 # Creating equality axioms
% 0.18/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.36 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 20 tableaux to operate on
% 0.18/0.37 # There were 1 total branch saturation attempts.
% 0.18/0.37 # There were 0 of these attempts blocked.
% 0.18/0.37 # There were 0 deferred branch saturation attempts.
% 0.18/0.37 # There were 0 free duplicated saturations.
% 0.18/0.37 # There were 1 total successful branch saturations.
% 0.18/0.37 # There were 0 successful branch saturations in interreduction.
% 0.18/0.37 # There were 0 successful branch saturations on the branch.
% 0.18/0.37 # There were 1 successful branch saturations after the branch.
% 0.18/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.37 # Begin clausification derivation
% 0.18/0.37
% 0.18/0.37 # End clausification derivation
% 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.37 cnf(i_0_24, plain, (compose(codomain(X1),X1)=X1)).
% 0.18/0.37 cnf(i_0_25, hypothesis, (there_exists(compose(a,b)))).
% 0.18/0.37 cnf(i_0_23, plain, (compose(X1,domain(X1))=X1)).
% 0.18/0.37 cnf(i_0_22, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3)))).
% 0.18/0.37 cnf(i_0_26, negated_conjecture, (codomain(compose(a,b))!=codomain(a))).
% 0.18/0.37 cnf(i_0_15, plain, (X1=X2|~equivalent(X1,X2))).
% 0.18/0.37 cnf(i_0_18, plain, (there_exists(X1)|~there_exists(codomain(X1)))).
% 0.18/0.37 cnf(i_0_17, plain, (there_exists(X1)|~there_exists(domain(X1)))).
% 0.18/0.37 cnf(i_0_14, plain, (there_exists(X1)|~equivalent(X1,X2))).
% 0.18/0.37 cnf(i_0_20, plain, (codomain(X1)=domain(X2)|~there_exists(compose(X2,X1)))).
% 0.18/0.37 cnf(i_0_19, plain, (there_exists(domain(X1))|~there_exists(compose(X1,X2)))).
% 0.18/0.37 cnf(i_0_21, plain, (there_exists(compose(X1,X2))|codomain(X2)!=domain(X1)|~there_exists(domain(X1)))).
% 0.18/0.37 cnf(i_0_16, plain, (equivalent(X1,X1)|~there_exists(X1))).
% 0.18/0.37 cnf(i_0_63, plain, (X4=X4)).
% 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.37 # Begin printing tableau
% 0.18/0.37 # Found 7 steps
% 0.18/0.37 cnf(i_0_24, plain, (compose(codomain(compose(a,b)),compose(a,b))=compose(a,b)), inference(start_rule)).
% 0.18/0.37 cnf(i_0_72, plain, (compose(codomain(compose(a,b)),compose(a,b))=compose(a,b)), inference(extension_rule, [i_0_70])).
% 0.18/0.37 cnf(i_0_128, plain, (codomain(compose(codomain(compose(a,b)),compose(a,b)))=codomain(compose(a,b))), inference(extension_rule, [i_0_67])).
% 0.18/0.37 cnf(i_0_159, plain, (compose(codomain(codomain(a)),codomain(a))!=codomain(a)), inference(closure_rule, [i_0_24])).
% 0.18/0.37 cnf(i_0_157, plain, (equivalent(codomain(compose(a,b)),codomain(a))), inference(extension_rule, [i_0_15])).
% 0.18/0.37 cnf(i_0_161, plain, (codomain(compose(a,b))=codomain(a)), inference(closure_rule, [i_0_26])).
% 0.18/0.37 cnf(i_0_160, plain, (~equivalent(codomain(compose(codomain(compose(a,b)),compose(a,b))),compose(codomain(codomain(a)),codomain(a)))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.18/0.37 # End printing tableau
% 0.18/0.37 # SZS output end
% 0.18/0.37 # Branches closed with saturation will be marked with an "s"
% 0.18/0.37 # There were 1 total branch saturation attempts.
% 0.18/0.37 # There were 0 of these attempts blocked.
% 0.18/0.37 # There were 0 deferred branch saturation attempts.
% 0.18/0.37 # There were 0 free duplicated saturations.
% 0.18/0.37 # There were 1 total successful branch saturations.
% 0.18/0.37 # There were 0 successful branch saturations in interreduction.
% 0.18/0.37 # There were 0 successful branch saturations on the branch.
% 0.18/0.37 # There were 1 successful branch saturations after the branch.
% 0.18/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.37 # Begin clausification derivation
% 0.18/0.37
% 0.18/0.37 # End clausification derivation
% 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.37 cnf(i_0_24, plain, (compose(codomain(X1),X1)=X1)).
% 0.18/0.37 cnf(i_0_25, hypothesis, (there_exists(compose(a,b)))).
% 0.18/0.37 cnf(i_0_23, plain, (compose(X1,domain(X1))=X1)).
% 0.18/0.37 cnf(i_0_22, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3)))).
% 0.18/0.37 cnf(i_0_26, negated_conjecture, (codomain(compose(a,b))!=codomain(a))).
% 0.18/0.37 cnf(i_0_15, plain, (X1=X2|~equivalent(X1,X2))).
% 0.18/0.37 cnf(i_0_18, plain, (there_exists(X1)|~there_exists(codomain(X1)))).
% 0.18/0.37 cnf(i_0_17, plain, (there_exists(X1)|~there_exists(domain(X1)))).
% 0.18/0.37 cnf(i_0_14, plain, (there_exists(X1)|~equivalent(X1,X2))).
% 0.18/0.37 cnf(i_0_20, plain, (codomain(X1)=domain(X2)|~there_exists(compose(X2,X1)))).
% 0.18/0.37 cnf(i_0_19, plain, (there_exists(domain(X1))|~there_exists(compose(X1,X2)))).
% 0.18/0.37 cnf(i_0_21, plain, (there_exists(compose(X1,X2))|codomain(X2)!=domain(X1)|~there_exists(domain(X1)))).
% 0.18/0.37 cnf(i_0_16, plain, (equivalent(X1,X1)|~there_exists(X1))).
% 0.18/0.37 cnf(i_0_63, plain, (X4=X4)).
% 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.37 # Begin printing tableau
% 0.18/0.37 # Found 9 steps
% 0.18/0.37 cnf(i_0_24, plain, (compose(codomain(codomain(a)),codomain(a))=codomain(a)), inference(start_rule)).
% 0.18/0.37 cnf(i_0_72, plain, (compose(codomain(codomain(a)),codomain(a))=codomain(a)), inference(extension_rule, [i_0_67])).
% 0.18/0.37 cnf(i_0_120, plain, (compose(codomain(codomain(compose(a,b))),codomain(compose(a,b)))!=codomain(compose(a,b))), inference(closure_rule, [i_0_24])).
% 0.18/0.37 cnf(i_0_119, plain, (equivalent(codomain(compose(a,b)),codomain(a))), inference(extension_rule, [i_0_15])).
% 0.18/0.37 cnf(i_0_133, plain, (codomain(compose(a,b))=codomain(a)), inference(closure_rule, [i_0_26])).
% 0.18/0.37 cnf(i_0_122, plain, (~equivalent(compose(codomain(codomain(compose(a,b))),codomain(compose(a,b))),compose(codomain(codomain(a)),codomain(a)))), inference(extension_rule, [i_0_67])).
% 0.18/0.37 cnf(i_0_158, plain, (codomain(compose(a,b))!=compose(codomain(codomain(compose(a,b))),codomain(compose(a,b)))), inference(closure_rule, [i_0_24])).
% 0.18/0.37 cnf(i_0_159, plain, (compose(codomain(compose(codomain(codomain(a)),codomain(a))),compose(codomain(codomain(a)),codomain(a)))!=compose(codomain(codomain(a)),codomain(a))), inference(closure_rule, [i_0_24])).
% 0.18/0.37 cnf(i_0_160, plain, (~equivalent(codomain(compose(a,b)),compose(codomain(compose(codomain(codomain(a)),codomain(a))),compose(codomain(codomain(a)),codomain(a))))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.18/0.37 # End printing tableau
% 0.18/0.37 # SZS output end
% 0.18/0.37 # Branches closed with saturation will be marked with an "s"
% 0.18/0.37 # Child (17253) has found a proof.
% 0.18/0.37
% 0.18/0.37 # Proof search is over...
% 0.18/0.37 # Freeing feature tree
%------------------------------------------------------------------------------