TSTP Solution File: CAT010-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CAT010-10 : TPTP v8.1.0. Released v7.3.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 : n029.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-10 : TPTP v8.1.0. Released v7.3.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.32 % Computer : n029.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun May 29 22:26:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 # No SInE strategy applied
% 0.12/0.35 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.12/0.35 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.12/0.35 #
% 0.12/0.35 # Number of axioms: 16 Number of unprocessed: 16
% 0.12/0.35 # Tableaux proof search.
% 0.12/0.35 # APR header successfully linked.
% 0.12/0.35 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 16 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 16 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 0 extension rule candidate clauses
% 0.12/0.36 # 16 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 36 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 36 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_29, plain, (compose(X1,domain(X1))=X1)).
% 0.18/0.37 cnf(i_0_30, plain, (compose(codomain(X1),X1)=X1)).
% 0.18/0.37 cnf(i_0_31, hypothesis, (there_exists(compose(a,b))=true)).
% 0.18/0.37 cnf(i_0_32, negated_conjecture, (codomain(compose(a,b))!=codomain(a))).
% 0.18/0.37 cnf(i_0_28, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3)))).
% 0.18/0.37 cnf(i_0_17, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 0.18/0.37 cnf(i_0_18, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.18/0.37 cnf(i_0_19, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.18/0.37 cnf(i_0_23, plain, (ifeq(there_exists(domain(X1)),true,there_exists(X1),true)=true)).
% 0.18/0.37 cnf(i_0_24, plain, (ifeq(there_exists(codomain(X1)),true,there_exists(X1),true)=true)).
% 0.18/0.37 cnf(i_0_21, plain, (ifeq2(equivalent(X1,X2),true,X1,X2)=X2)).
% 0.18/0.37 cnf(i_0_22, plain, (ifeq(there_exists(X1),true,equivalent(X1,X1),true)=true)).
% 0.18/0.37 cnf(i_0_20, plain, (ifeq(equivalent(X1,X2),true,there_exists(X1),true)=true)).
% 0.18/0.37 cnf(i_0_26, plain, (ifeq2(there_exists(compose(X1,X2)),true,domain(X1),codomain(X2))=codomain(X2))).
% 0.18/0.37 cnf(i_0_25, plain, (ifeq(there_exists(compose(X1,X2)),true,there_exists(domain(X1)),true)=true)).
% 0.18/0.37 cnf(i_0_27, plain, (ifeq(there_exists(domain(X1)),true,ifeq3(domain(X1),codomain(X2),there_exists(compose(X1,X2)),true),true)=true)).
% 0.18/0.37 cnf(i_0_34, 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 5 steps
% 0.18/0.37 cnf(i_0_29, plain, (compose(X3,domain(X3))=X3), inference(start_rule)).
% 0.18/0.37 cnf(i_0_46, plain, (compose(X3,domain(X3))=X3), inference(extension_rule, [i_0_43])).
% 0.18/0.37 cnf(i_0_90, plain, (domain(compose(X3,domain(X3)))=domain(X3)), inference(extension_rule, [i_0_37])).
% 0.18/0.37 cnf(i_0_103, plain, (domain(X3)!=compose(domain(X3),domain(domain(X3)))), inference(closure_rule, [i_0_29])).
% 0.18/0.37 cnf(i_0_101, plain, (domain(compose(X3,domain(X3)))=compose(domain(X3),domain(domain(X3)))), inference(etableau_closure_rule, [i_0_101, ...])).
% 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 (21738) has found a proof.
% 0.18/0.37
% 0.18/0.37 # Proof search is over...
% 0.18/0.37 # Freeing feature tree
%------------------------------------------------------------------------------