TSTP Solution File: CAT018-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CAT018-3 : 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 : n032.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:58 EDT 2022
% Result : Unsatisfiable 0.16s 0.38s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : CAT018-3 : TPTP v8.1.0. Released v1.0.0.
% 0.05/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Sun May 29 21:11:41 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.16/0.33 # No SInE strategy applied
% 0.16/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.33 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.16/0.33 #
% 0.16/0.33 # Presaturation interreduction done
% 0.16/0.33 # Number of axioms: 19 Number of unprocessed: 18
% 0.16/0.33 # Tableaux proof search.
% 0.16/0.33 # APR header successfully linked.
% 0.16/0.33 # Hello from C++
% 0.16/0.33 # The folding up rule is enabled...
% 0.16/0.33 # Local unification is enabled...
% 0.16/0.33 # Any saturation attempts will use folding labels...
% 0.16/0.33 # 18 beginning clauses after preprocessing and clausification
% 0.16/0.33 # Creating start rules for all 1 conjectures.
% 0.16/0.33 # There are 1 start rule candidates:
% 0.16/0.33 # Found 6 unit axioms.
% 0.16/0.33 # 1 start rule tableaux created.
% 0.16/0.33 # 12 extension rule candidate clauses
% 0.16/0.33 # 6 unit axiom clauses
% 0.16/0.33
% 0.16/0.33 # Requested 8, 32 cores available to the main process.
% 0.16/0.33 # There are not enough tableaux to fork, creating more from the initial 1
% 0.16/0.38 # There were 2 total branch saturation attempts.
% 0.16/0.38 # There were 0 of these attempts blocked.
% 0.16/0.38 # There were 0 deferred branch saturation attempts.
% 0.16/0.38 # There were 0 free duplicated saturations.
% 0.16/0.38 # There were 2 total successful branch saturations.
% 0.16/0.38 # There were 0 successful branch saturations in interreduction.
% 0.16/0.38 # There were 0 successful branch saturations on the branch.
% 0.16/0.38 # There were 2 successful branch saturations after the branch.
% 0.16/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.38 # Begin clausification derivation
% 0.16/0.38
% 0.16/0.38 # End clausification derivation
% 0.16/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.16/0.38 cnf(i_0_38, hypothesis, (there_exists(compose(a,b)))).
% 0.16/0.38 cnf(i_0_39, hypothesis, (there_exists(compose(b,c)))).
% 0.16/0.38 cnf(i_0_30, plain, (compose(X1,domain(X1))=X1)).
% 0.16/0.38 cnf(i_0_31, plain, (compose(codomain(X1),X1)=X1)).
% 0.16/0.38 cnf(i_0_29, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3)))).
% 0.16/0.38 cnf(i_0_40, negated_conjecture, (~there_exists(compose(a,compose(b,c))))).
% 0.16/0.38 cnf(i_0_24, plain, (there_exists(X1)|~there_exists(domain(X1)))).
% 0.16/0.38 cnf(i_0_25, plain, (there_exists(X1)|~there_exists(codomain(X1)))).
% 0.16/0.38 cnf(i_0_32, plain, (there_exists(X1)|~equivalent(X2,X1))).
% 0.16/0.38 cnf(i_0_21, plain, (there_exists(X1)|~equivalent(X1,X2))).
% 0.16/0.38 cnf(i_0_22, plain, (X1=X2|~equivalent(X1,X2))).
% 0.16/0.38 cnf(i_0_23, plain, (equivalent(X1,X1)|~there_exists(X1))).
% 0.16/0.38 cnf(i_0_26, plain, (there_exists(domain(X1))|~there_exists(compose(X1,X2)))).
% 0.16/0.38 cnf(i_0_34, plain, (there_exists(codomain(X1))|~there_exists(compose(X1,X2)))).
% 0.16/0.38 cnf(i_0_35, plain, (X1=X2|there_exists(f1(X1,X2)))).
% 0.16/0.38 cnf(i_0_27, plain, (codomain(X1)=domain(X2)|~there_exists(compose(X2,X1)))).
% 0.16/0.38 cnf(i_0_28, plain, (there_exists(compose(X1,X2))|codomain(X2)!=domain(X1)|~there_exists(domain(X1)))).
% 0.16/0.38 cnf(i_0_36, plain, (f1(X1,X2)=X1|f1(X1,X2)=X2|X1=X2)).
% 0.16/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.16/0.38 # Begin printing tableau
% 0.16/0.38 # Found 5 steps
% 0.16/0.38 cnf(i_0_40, negated_conjecture, (~there_exists(compose(a,compose(b,c)))), inference(start_rule)).
% 0.16/0.38 cnf(i_0_43, plain, (~there_exists(compose(a,compose(b,c)))), inference(extension_rule, [i_0_28])).
% 0.16/0.38 cnf(i_0_65, plain, (codomain(compose(b,c))!=domain(a)), inference(extension_rule, [i_0_22])).
% 0.16/0.38 cnf(i_0_66, plain, (~there_exists(domain(a))), inference(etableau_closure_rule, [i_0_66, ...])).
% 0.16/0.38 cnf(i_0_79, plain, (~equivalent(codomain(compose(b,c)),domain(a))), inference(etableau_closure_rule, [i_0_79, ...])).
% 0.16/0.38 # End printing tableau
% 0.16/0.38 # SZS output end
% 0.16/0.38 # Branches closed with saturation will be marked with an "s"
% 0.16/0.38 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.16/0.38 # We now have 5 tableaux to operate on
% 0.16/0.38 # Found closed tableau during pool population.
% 0.16/0.38 # Proof search is over...
% 0.16/0.38 # Freeing feature tree
%------------------------------------------------------------------------------