TSTP Solution File: CAT005-4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CAT005-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 : n024.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.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CAT005-4 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 17:54:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.12/0.37 # and selection function SelectCQArEqLast.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 15 Number of unprocessed: 15
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 15 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 5 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 10 extension rule candidate clauses
% 0.12/0.37 # 5 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 22 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/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/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_25, plain, (compose(X1,domain(X1))=X1)).
% 0.12/0.37 cnf(i_0_27, hypothesis, (there_exists(compose(a,d)))).
% 0.12/0.37 cnf(i_0_26, plain, (compose(codomain(X1),X1)=X1)).
% 0.12/0.37 cnf(i_0_24, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3)))).
% 0.12/0.37 cnf(i_0_30, negated_conjecture, (domain(a)!=d)).
% 0.12/0.37 cnf(i_0_19, plain, (there_exists(X1)|~there_exists(domain(X1)))).
% 0.12/0.37 cnf(i_0_17, plain, (X1=X2|~equivalent(X1,X2))).
% 0.12/0.37 cnf(i_0_16, plain, (there_exists(X1)|~equivalent(X1,X2))).
% 0.12/0.37 cnf(i_0_20, plain, (there_exists(X1)|~there_exists(codomain(X1)))).
% 0.12/0.37 cnf(i_0_28, hypothesis, (compose(X1,d)=X1|~there_exists(compose(X1,d)))).
% 0.12/0.37 cnf(i_0_29, hypothesis, (compose(d,X1)=X1|~there_exists(compose(d,X1)))).
% 0.12/0.37 cnf(i_0_22, plain, (codomain(X1)=domain(X2)|~there_exists(compose(X2,X1)))).
% 0.12/0.37 cnf(i_0_21, plain, (there_exists(domain(X1))|~there_exists(compose(X1,X2)))).
% 0.12/0.37 cnf(i_0_23, plain, (there_exists(compose(X1,X2))|codomain(X2)!=domain(X1)|~there_exists(domain(X1)))).
% 0.12/0.37 cnf(i_0_18, plain, (equivalent(X1,X1)|~there_exists(X1))).
% 0.12/0.37 cnf(i_0_75, plain, (X4=X4)).
% 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_25, plain, (compose(a,domain(a))=a), inference(start_rule)).
% 0.12/0.37 cnf(i_0_84, plain, (compose(a,domain(a))=a), inference(extension_rule, [i_0_81])).
% 0.12/0.37 cnf(i_0_146, plain, (domain(compose(a,domain(a)))=domain(a)), inference(extension_rule, [i_0_79])).
% 0.12/0.37 cnf(i_0_183, plain, (compose(d,domain(d))!=d), inference(closure_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_181, plain, (equivalent(domain(a),d)), inference(extension_rule, [i_0_17])).
% 0.12/0.37 cnf(i_0_187, plain, (domain(a)=d), inference(closure_rule, [i_0_30])).
% 0.12/0.37 cnf(i_0_184, plain, (~equivalent(domain(compose(a,domain(a))),compose(d,domain(d)))), inference(etableau_closure_rule, [i_0_184, ...])).
% 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/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/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_25, plain, (compose(X1,domain(X1))=X1)).
% 0.12/0.37 cnf(i_0_27, hypothesis, (there_exists(compose(a,d)))).
% 0.12/0.37 cnf(i_0_26, plain, (compose(codomain(X1),X1)=X1)).
% 0.12/0.37 cnf(i_0_24, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3)))).
% 0.12/0.37 cnf(i_0_30, negated_conjecture, (domain(a)!=d)).
% 0.12/0.37 cnf(i_0_19, plain, (there_exists(X1)|~there_exists(domain(X1)))).
% 0.12/0.37 cnf(i_0_17, plain, (X1=X2|~equivalent(X1,X2))).
% 0.12/0.37 cnf(i_0_16, plain, (there_exists(X1)|~equivalent(X1,X2))).
% 0.12/0.37 cnf(i_0_20, plain, (there_exists(X1)|~there_exists(codomain(X1)))).
% 0.12/0.37 cnf(i_0_28, hypothesis, (compose(X1,d)=X1|~there_exists(compose(X1,d)))).
% 0.12/0.37 cnf(i_0_29, hypothesis, (compose(d,X1)=X1|~there_exists(compose(d,X1)))).
% 0.12/0.37 cnf(i_0_22, plain, (codomain(X1)=domain(X2)|~there_exists(compose(X2,X1)))).
% 0.12/0.37 cnf(i_0_21, plain, (there_exists(domain(X1))|~there_exists(compose(X1,X2)))).
% 0.12/0.37 cnf(i_0_23, plain, (there_exists(compose(X1,X2))|codomain(X2)!=domain(X1)|~there_exists(domain(X1)))).
% 0.12/0.37 cnf(i_0_18, plain, (equivalent(X1,X1)|~there_exists(X1))).
% 0.12/0.37 cnf(i_0_75, plain, (X4=X4)).
% 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 9 steps
% 0.12/0.37 cnf(i_0_25, plain, (compose(d,domain(d))=d), inference(start_rule)).
% 0.12/0.37 cnf(i_0_84, plain, (compose(d,domain(d))=d), inference(extension_rule, [i_0_79])).
% 0.12/0.37 cnf(i_0_140, plain, (compose(domain(a),domain(domain(a)))!=domain(a)), inference(closure_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_139, plain, (equivalent(domain(a),d)), inference(extension_rule, [i_0_17])).
% 0.12/0.37 cnf(i_0_155, plain, (domain(a)=d), inference(closure_rule, [i_0_30])).
% 0.12/0.37 cnf(i_0_142, plain, (~equivalent(compose(domain(a),domain(domain(a))),compose(d,domain(d)))), inference(extension_rule, [i_0_79])).
% 0.12/0.37 cnf(i_0_184, plain, (domain(a)!=compose(domain(a),domain(domain(a)))), inference(closure_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_185, plain, (compose(compose(d,domain(d)),domain(compose(d,domain(d))))!=compose(d,domain(d))), inference(closure_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_186, plain, (~equivalent(domain(a),compose(compose(d,domain(d)),domain(compose(d,domain(d)))))), inference(etableau_closure_rule, [i_0_186, ...])).
% 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/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/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_25, plain, (compose(X1,domain(X1))=X1)).
% 0.12/0.37 cnf(i_0_27, hypothesis, (there_exists(compose(a,d)))).
% 0.12/0.37 cnf(i_0_26, plain, (compose(codomain(X1),X1)=X1)).
% 0.12/0.37 cnf(i_0_24, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3)))).
% 0.12/0.37 cnf(i_0_30, negated_conjecture, (domain(a)!=d)).
% 0.12/0.37 cnf(i_0_19, plain, (there_exists(X1)|~there_exists(domain(X1)))).
% 0.12/0.37 cnf(i_0_17, plain, (X1=X2|~equivalent(X1,X2))).
% 0.12/0.37 cnf(i_0_16, plain, (there_exists(X1)|~equivalent(X1,X2))).
% 0.12/0.37 cnf(i_0_20, plain, (there_exists(X1)|~there_exists(codomain(X1)))).
% 0.12/0.37 cnf(i_0_28, hypothesis, (compose(X1,d)=X1|~there_exists(compose(X1,d)))).
% 0.12/0.37 cnf(i_0_29, hypothesis, (compose(d,X1)=X1|~there_exists(compose(d,X1)))).
% 0.12/0.37 cnf(i_0_22, plain, (codomain(X1)=domain(X2)|~there_exists(compose(X2,X1)))).
% 0.12/0.37 cnf(i_0_21, plain, (there_exists(domain(X1))|~there_exists(compose(X1,X2)))).
% 0.12/0.37 cnf(i_0_23, plain, (there_exists(compose(X1,X2))|codomain(X2)!=domain(X1)|~there_exists(domain(X1)))).
% 0.12/0.37 cnf(i_0_18, plain, (equivalent(X1,X1)|~there_exists(X1))).
% 0.12/0.37 cnf(i_0_75, plain, (X4=X4)).
% 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 9 steps
% 0.12/0.37 cnf(i_0_25, plain, (compose(domain(a),domain(domain(a)))=domain(a)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_84, plain, (compose(domain(a),domain(domain(a)))=domain(a)), inference(extension_rule, [i_0_79])).
% 0.12/0.37 cnf(i_0_141, plain, (compose(d,domain(d))!=d), inference(closure_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_139, plain, (equivalent(domain(a),d)), inference(extension_rule, [i_0_17])).
% 0.12/0.37 cnf(i_0_155, plain, (domain(a)=d), inference(closure_rule, [i_0_30])).
% 0.12/0.37 cnf(i_0_142, plain, (~equivalent(compose(domain(a),domain(domain(a))),compose(d,domain(d)))), inference(extension_rule, [i_0_79])).
% 0.12/0.37 cnf(i_0_184, plain, (domain(a)!=compose(domain(a),domain(domain(a)))), inference(closure_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_185, plain, (compose(compose(d,domain(d)),domain(compose(d,domain(d))))!=compose(d,domain(d))), inference(closure_rule, [i_0_25])).
% 0.12/0.37 cnf(i_0_186, plain, (~equivalent(domain(a),compose(compose(d,domain(d)),domain(compose(d,domain(d)))))), inference(etableau_closure_rule, [i_0_186, ...])).
% 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 (28351) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------