TSTP Solution File: ALG030-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ALG030-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 : n022.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 16:51:15 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ALG030-10 : TPTP v8.1.0. Released v7.3.0.
% 0.06/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 : n022.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 : Wed Jun 8 22:53:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.39 # No SInE strategy applied
% 0.20/0.39 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.20/0.39 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.20/0.39 #
% 0.20/0.39 # Number of axioms: 14 Number of unprocessed: 14
% 0.20/0.39 # Tableaux proof search.
% 0.20/0.39 # APR header successfully linked.
% 0.20/0.39 # Hello from C++
% 0.20/0.39 # The folding up rule is enabled...
% 0.20/0.39 # Local unification is enabled...
% 0.20/0.39 # Any saturation attempts will use folding labels...
% 0.20/0.39 # 14 beginning clauses after preprocessing and clausification
% 0.20/0.39 # Creating start rules for all 6 conjectures.
% 0.20/0.39 # There are 6 start rule candidates:
% 0.20/0.39 # Found 14 unit axioms.
% 0.20/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.39 # 6 start rule tableaux created.
% 0.20/0.39 # 0 extension rule candidate clauses
% 0.20/0.39 # 14 unit axiom clauses
% 0.20/0.39
% 0.20/0.39 # Requested 8, 32 cores available to the main process.
% 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 6
% 0.20/0.39 # Creating equality axioms
% 0.20/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.39 # Returning from population with 32 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.39 # We now have 32 tableaux to operate on
% 0.20/0.41 # There were 1 total branch saturation attempts.
% 0.20/0.41 # There were 0 of these attempts blocked.
% 0.20/0.41 # There were 0 deferred branch saturation attempts.
% 0.20/0.41 # There were 0 free duplicated saturations.
% 0.20/0.41 # There were 1 total successful branch saturations.
% 0.20/0.41 # There were 0 successful branch saturations in interreduction.
% 0.20/0.41 # There were 0 successful branch saturations on the branch.
% 0.20/0.41 # There were 1 successful branch saturations after the branch.
% 0.20/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41 # Begin clausification derivation
% 0.20/0.41
% 0.20/0.41 # End clausification derivation
% 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.41 cnf(i_0_21, plain, (sorti1(sK2_ax3_U)=true)).
% 0.20/0.41 cnf(i_0_20, plain, (sorti1(sK1_ax3_V)=true)).
% 0.20/0.41 cnf(i_0_19, plain, (op1(sK2_ax3_U,sK1_ax3_V)!=op1(sK1_ax3_V,sK2_ax3_U))).
% 0.20/0.41 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.20/0.41 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.20/0.41 cnf(i_0_23, negated_conjecture, (ifeq(sorti1(X1),true,sorti2(h(X1)),true)=true)).
% 0.20/0.41 cnf(i_0_26, negated_conjecture, (ifeq(sorti2(X1),true,sorti1(j(X1)),true)=true)).
% 0.20/0.41 cnf(i_0_25, negated_conjecture, (ifeq2(sorti1(X1),true,j(h(X1)),X1)=X1)).
% 0.20/0.41 cnf(i_0_28, negated_conjecture, (ifeq2(sorti2(X1),true,h(j(X1)),X1)=X1)).
% 0.20/0.41 cnf(i_0_17, plain, (ifeq(sorti1(X1),true,ifeq(sorti1(X2),true,sorti1(op1(X2,X1)),true),true)=true)).
% 0.20/0.41 cnf(i_0_18, plain, (ifeq(sorti2(X1),true,ifeq(sorti2(X2),true,sorti2(op2(X2,X1)),true),true)=true)).
% 0.20/0.41 cnf(i_0_22, plain, (ifeq2(sorti2(X1),true,ifeq2(sorti2(X2),true,op2(X2,X1),op2(X1,X2)),op2(X1,X2))=op2(X1,X2))).
% 0.20/0.41 cnf(i_0_24, negated_conjecture, (ifeq2(sorti1(X1),true,ifeq2(sorti1(X2),true,op2(h(X2),h(X1)),h(op1(X2,X1))),h(op1(X2,X1)))=h(op1(X2,X1)))).
% 0.20/0.41 cnf(i_0_27, negated_conjecture, (ifeq2(sorti2(X1),true,ifeq2(sorti2(X2),true,op1(j(X2),j(X1)),j(op2(X2,X1))),j(op2(X2,X1)))=j(op2(X2,X1)))).
% 0.20/0.41 cnf(i_0_35, plain, (X4=X4)).
% 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.41 # Begin printing tableau
% 0.20/0.41 # Found 5 steps
% 0.20/0.41 cnf(i_0_21, plain, (sorti1(sK2_ax3_U)=true), inference(start_rule)).
% 0.20/0.41 cnf(i_0_47, plain, (sorti1(sK2_ax3_U)=true), inference(extension_rule, [i_0_41])).
% 0.20/0.41 cnf(i_0_79, plain, (sorti1(sorti1(sK2_ax3_U))=sorti1(true)), inference(extension_rule, [i_0_38])).
% 0.20/0.41 cnf(i_0_99, plain, (sorti1(true)!=ifeq2(sorti1(sorti1(true)),true,j(h(sorti1(true))),sorti1(true))), inference(closure_rule, [i_0_25])).
% 0.20/0.41 cnf(i_0_97, plain, (sorti1(sorti1(sK2_ax3_U))=ifeq2(sorti1(sorti1(true)),true,j(h(sorti1(true))),sorti1(true))), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.20/0.41 # End printing tableau
% 0.20/0.41 # SZS output end
% 0.20/0.41 # Branches closed with saturation will be marked with an "s"
% 0.20/0.41 # Child (14036) has found a proof.
% 0.20/0.41
% 0.20/0.41 # Proof search is over...
% 0.20/0.41 # Freeing feature tree
%------------------------------------------------------------------------------