TSTP Solution File: CAT001-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CAT001-10 : TPTP v8.1.0. Released v7.5.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 : n017.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 : Satisfiable 2.13s 0.63s
% Output : CNFRefutation 2.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CAT001-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun May 29 16:49:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 14 Number of unprocessed: 14
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 14 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 14 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 0 extension rule candidate clauses
% 0.13/0.37 # 14 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 24 tableaux to operate on
% 1.40/0.62 # 23950 Satisfiable branch
% 2.13/0.63 # Satisfiable branch found.
% 2.13/0.63 # There were 1 total branch saturation attempts.
% 2.13/0.63 # There were 0 of these attempts blocked.
% 2.13/0.63 # There were 0 deferred branch saturation attempts.
% 2.13/0.63 # There were 0 free duplicated saturations.
% 2.13/0.63 # There were 0 total successful branch saturations.
% 2.13/0.63 # There were 0 successful branch saturations in interreduction.
% 2.13/0.63 # There were 0 successful branch saturations on the branch.
% 2.13/0.63 # There were 0 successful branch saturations after the branch.
% 2.13/0.63 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.13/0.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.13/0.63 # Begin clausification derivation
% 2.13/0.63
% 2.13/0.63 # End clausification derivation
% 2.13/0.63 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.13/0.63 cnf(i_0_24, hypothesis, (domain(h)=domain(b))).
% 2.13/0.63 cnf(i_0_26, hypothesis, (domain(g)=domain(b))).
% 2.13/0.63 cnf(i_0_25, hypothesis, (codomain(a)=domain(b))).
% 2.13/0.63 cnf(i_0_27, hypothesis, (compose(a,g)=compose(a,h))).
% 2.13/0.63 cnf(i_0_17, plain, (domain(codomain(X1))=codomain(X1))).
% 2.13/0.63 cnf(i_0_16, plain, (codomain(domain(X1))=domain(X1))).
% 2.13/0.63 cnf(i_0_19, plain, (compose(X1,codomain(X1))=X1)).
% 2.13/0.63 cnf(i_0_18, plain, (compose(domain(X1),X1)=X1)).
% 2.13/0.63 cnf(i_0_15, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 2.13/0.63 cnf(i_0_20, plain, (ifeq(codomain(X1),domain(X2),domain(compose(X1,X2)),domain(X1))=domain(X1))).
% 2.13/0.63 cnf(i_0_21, plain, (ifeq(codomain(X1),domain(X2),codomain(compose(X1,X2)),codomain(X2))=codomain(X2))).
% 2.13/0.63 cnf(i_0_22, plain, (ifeq(codomain(X1),domain(X2),ifeq(codomain(X3),domain(X1),compose(X3,compose(X1,X2)),compose(compose(X3,X1),X2)),compose(compose(X3,X1),X2))=compose(compose(X3,X1),X2))).
% 2.13/0.63 cnf(i_0_23, hypothesis, (ifeq(codomain(X1),domain(compose(a,b)),ifeq(codomain(X2),domain(compose(a,b)),ifeq(compose(X1,compose(a,b)),X3,ifeq(compose(X2,compose(a,b)),X3,X2,X1),X1),X1),X1)=X1)).
% 2.13/0.63 cnf(i_0_28, negated_conjecture, (g!=h)).
% 2.13/0.63 cnf(i_0_30, plain, (X4=X4)).
% 2.13/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.13/0.63 # Begin printing tableau
% 2.13/0.63 # Found 7 steps
% 2.13/0.63 cnf(i_0_24, hypothesis, (domain(h)=domain(b)), inference(start_rule)).
% 2.13/0.63 cnf(i_0_38, plain, (domain(h)=domain(b)), inference(extension_rule, [i_0_34])).
% 2.13/0.63 cnf(i_0_62, plain, (domain(h)!=domain(b)), inference(closure_rule, [i_0_24])).
% 2.13/0.63 cnf(i_0_63, plain, (domain(h)!=domain(b)), inference(closure_rule, [i_0_24])).
% 2.13/0.63 cnf(i_0_64, plain, (domain(h)!=domain(b)), inference(closure_rule, [i_0_24])).
% 2.13/0.63 cnf(i_0_60, plain, (ifeq(domain(h),domain(h),domain(h),domain(h))=ifeq(domain(b),domain(b),domain(b),domain(b))), inference(extension_rule, [i_0_33])).
% 2.13/0.63 cnf(i_0_78, plain, (ifeq(domain(b),domain(b),domain(b),domain(b))!=compose(ifeq(domain(b),domain(b),domain(b),domain(b)),codomain(ifeq(domain(b),domain(b),domain(b),domain(b))))), inference(closure_rule, [i_0_19])).
% 2.13/0.63 # End printing tableau
% 2.13/0.63 # SZS output end
% 2.13/0.63 # Branches closed with saturation will be marked with an "s"
% 2.13/0.63 # Child (23950) has found a proof.
% 2.13/0.63
% 2.13/0.63 # Proof search is over...
% 2.13/0.63 # Freeing feature tree
%------------------------------------------------------------------------------