TSTP Solution File: CAT004-4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CAT004-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 : 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:53 EDT 2022
% Result : Unsatisfiable 1.00s 1.17s
% Output : CNFRefutation 1.00s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CAT004-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 : n017.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 20:57:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 17 Number of unprocessed: 17
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.93/1.10 # The folding up rule is enabled...
% 0.93/1.10 # Local unification is enabled...
% 0.93/1.10 # Any saturation attempts will use folding labels...
% 0.93/1.10 # 17 beginning clauses after preprocessing and clausification
% 0.93/1.10 # Creating start rules for all 1 conjectures.
% 0.93/1.10 # There are 1 start rule candidates:
% 0.93/1.10 # Found 7 unit axioms.
% 0.93/1.10 # 1 start rule tableaux created.
% 0.93/1.10 # 10 extension rule candidate clauses
% 0.93/1.10 # 7 unit axiom clauses
% 0.93/1.10
% 0.93/1.10 # Requested 8, 32 cores available to the main process.
% 0.93/1.10 # There are not enough tableaux to fork, creating more from the initial 1
% 1.00/1.17 # There were 1 total branch saturation attempts.
% 1.00/1.17 # There were 0 of these attempts blocked.
% 1.00/1.17 # There were 0 deferred branch saturation attempts.
% 1.00/1.17 # There were 0 free duplicated saturations.
% 1.00/1.17 # There were 1 total successful branch saturations.
% 1.00/1.17 # There were 0 successful branch saturations in interreduction.
% 1.00/1.17 # There were 0 successful branch saturations on the branch.
% 1.00/1.17 # There were 1 successful branch saturations after the branch.
% 1.00/1.17 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.00/1.17 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.00/1.17 # Begin clausification derivation
% 1.00/1.17
% 1.00/1.17 # End clausification derivation
% 1.00/1.17 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.00/1.17 cnf(i_0_32, hypothesis, (there_exists(h))).
% 1.00/1.17 cnf(i_0_27, plain, (compose(X1,domain(X1))=X1)).
% 1.00/1.17 cnf(i_0_28, plain, (compose(codomain(X1),X1)=X1)).
% 1.00/1.17 cnf(i_0_29, hypothesis, (there_exists(compose(a,b)))).
% 1.00/1.17 cnf(i_0_33, hypothesis, (compose(g,compose(a,b))=compose(h,compose(a,b)))).
% 1.00/1.17 cnf(i_0_26, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3)))).
% 1.00/1.17 cnf(i_0_34, negated_conjecture, (g!=h)).
% 1.00/1.17 cnf(i_0_19, plain, (X1=X2|~equivalent(X1,X2))).
% 1.00/1.17 cnf(i_0_21, plain, (there_exists(X1)|~there_exists(domain(X1)))).
% 1.00/1.17 cnf(i_0_22, plain, (there_exists(X1)|~there_exists(codomain(X1)))).
% 1.00/1.17 cnf(i_0_18, plain, (there_exists(X1)|~equivalent(X1,X2))).
% 1.00/1.17 cnf(i_0_20, plain, (equivalent(X1,X1)|~there_exists(X1))).
% 1.00/1.17 cnf(i_0_23, plain, (there_exists(domain(X1))|~there_exists(compose(X1,X2)))).
% 1.00/1.17 cnf(i_0_24, plain, (codomain(X1)=domain(X2)|~there_exists(compose(X2,X1)))).
% 1.00/1.17 cnf(i_0_30, hypothesis, (X1=X2|compose(X1,a)!=compose(X2,a))).
% 1.00/1.17 cnf(i_0_31, hypothesis, (X1=X2|compose(X1,b)!=compose(X2,b))).
% 1.00/1.17 cnf(i_0_25, plain, (there_exists(compose(X1,X2))|codomain(X2)!=domain(X1)|~there_exists(domain(X1)))).
% 1.00/1.17 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.00/1.17 # Begin printing tableau
% 1.00/1.17 # Found 4 steps
% 1.00/1.17 cnf(i_0_34, negated_conjecture, (g!=h), inference(start_rule)).
% 1.00/1.17 cnf(i_0_38, plain, (g!=h), inference(extension_rule, [i_0_31])).
% 1.00/1.17 cnf(i_0_56, plain, (compose(g,b)!=compose(h,b)), inference(extension_rule, [i_0_19])).
% 1.00/1.17 cnf(i_0_61, plain, (~equivalent(compose(g,b),compose(h,b))), inference(etableau_closure_rule, [i_0_61, ...])).
% 1.00/1.17 # End printing tableau
% 1.00/1.17 # SZS output end
% 1.00/1.17 # Branches closed with saturation will be marked with an "s"
% 1.00/1.17 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 1.00/1.17 # We now have 3 tableaux to operate on
% 1.00/1.17 # Found closed tableau during pool population.
% 1.00/1.17 # Proof search is over...
% 1.00/1.17 # Freeing feature tree
%------------------------------------------------------------------------------