TSTP Solution File: GRP689-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP689-1 : TPTP v8.1.0. Released v4.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 : n019.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 : Sat Jul 16 09:08:02 EDT 2022
% Result : Unsatisfiable 35.27s 4.84s
% Output : CNFRefutation 35.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP689-1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % 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 : n019.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 : Mon Jun 13 05:59:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18C___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: 12 Number of unprocessed: 12
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # 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 # 12 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 12 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 0 extension rule candidate clauses
% 0.12/0.36 # 12 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 21 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 21 tableaux to operate on
% 35.27/4.84 # There were 1 total branch saturation attempts.
% 35.27/4.84 # There were 0 of these attempts blocked.
% 35.27/4.84 # There were 0 deferred branch saturation attempts.
% 35.27/4.84 # There were 0 free duplicated saturations.
% 35.27/4.84 # There were 1 total successful branch saturations.
% 35.27/4.84 # There were 0 successful branch saturations in interreduction.
% 35.27/4.84 # There were 0 successful branch saturations on the branch.
% 35.27/4.84 # There were 1 successful branch saturations after the branch.
% 35.27/4.84 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 35.27/4.84 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 35.27/4.84 # Begin clausification derivation
% 35.27/4.84
% 35.27/4.84 # End clausification derivation
% 35.27/4.84 # Begin listing active clauses obtained from FOF to CNF conversion
% 35.27/4.84 cnf(i_0_22, plain, (mult(op_c,mult(op_c,mult(op_c,op_c)))=unit)).
% 35.27/4.84 cnf(i_0_23, plain, (mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,op_d))))))))=unit)).
% 35.27/4.84 cnf(i_0_17, plain, (mult(X1,unit)=X1)).
% 35.27/4.84 cnf(i_0_18, plain, (mult(unit,X1)=X1)).
% 35.27/4.84 cnf(i_0_14, plain, (ld(X1,mult(X1,X2))=X2)).
% 35.27/4.84 cnf(i_0_13, plain, (mult(X1,ld(X1,X2))=X2)).
% 35.27/4.84 cnf(i_0_15, plain, (mult(rd(X1,X2),X2)=X1)).
% 35.27/4.84 cnf(i_0_16, plain, (rd(mult(X1,X2),X2)=X1)).
% 35.27/4.84 cnf(i_0_20, plain, (mult(i(X1),mult(X1,X2))=X2)).
% 35.27/4.84 cnf(i_0_21, plain, (mult(i(X1),i(X2))=i(mult(X1,X2)))).
% 35.27/4.84 cnf(i_0_19, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))).
% 35.27/4.84 cnf(i_0_24, negated_conjecture, (mult(op_c,op_d)!=mult(op_d,op_c))).
% 35.27/4.84 cnf(i_0_26, plain, (X4=X4)).
% 35.27/4.84 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 35.27/4.84 # Begin printing tableau
% 35.27/4.84 # Found 6 steps
% 35.27/4.84 cnf(i_0_22, plain, (mult(op_c,mult(op_c,mult(op_c,op_c)))=unit), inference(start_rule)).
% 35.27/4.84 cnf(i_0_34, plain, (mult(op_c,mult(op_c,mult(op_c,op_c)))=unit), inference(extension_rule, [i_0_31])).
% 35.27/4.84 cnf(i_0_58, plain, (mult(op_c,mult(op_c,mult(op_c,op_c)))!=unit), inference(closure_rule, [i_0_22])).
% 35.27/4.84 cnf(i_0_57, plain, (mult(mult(op_c,mult(op_c,mult(op_c,op_c))),mult(op_c,mult(op_c,mult(op_c,op_c))))=mult(unit,unit)), inference(extension_rule, [i_0_29])).
% 35.27/4.84 cnf(i_0_71, plain, (mult(unit,unit)!=unit), inference(closure_rule, [i_0_17])).
% 35.27/4.84 cnf(i_0_69, plain, (mult(mult(op_c,mult(op_c,mult(op_c,op_c))),mult(op_c,mult(op_c,mult(op_c,op_c))))=unit), inference(etableau_closure_rule, [i_0_69, ...])).
% 35.27/4.84 # End printing tableau
% 35.27/4.84 # SZS output end
% 35.27/4.84 # Branches closed with saturation will be marked with an "s"
% 35.27/4.85 # There were 1 total branch saturation attempts.
% 35.27/4.85 # There were 0 of these attempts blocked.
% 35.27/4.85 # There were 0 deferred branch saturation attempts.
% 35.27/4.85 # There were 0 free duplicated saturations.
% 35.27/4.85 # There were 1 total successful branch saturations.
% 35.27/4.85 # There were 0 successful branch saturations in interreduction.
% 35.27/4.85 # There were 0 successful branch saturations on the branch.
% 35.27/4.85 # There were 1 successful branch saturations after the branch.
% 35.27/4.85 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 35.27/4.85 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 35.27/4.85 # Begin clausification derivation
% 35.27/4.85
% 35.27/4.85 # End clausification derivation
% 35.27/4.85 # Begin listing active clauses obtained from FOF to CNF conversion
% 35.27/4.85 cnf(i_0_22, plain, (mult(op_c,mult(op_c,mult(op_c,op_c)))=unit)).
% 35.27/4.85 cnf(i_0_23, plain, (mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,mult(op_d,op_d))))))))=unit)).
% 35.27/4.85 cnf(i_0_17, plain, (mult(X1,unit)=X1)).
% 35.27/4.85 cnf(i_0_18, plain, (mult(unit,X1)=X1)).
% 35.27/4.85 cnf(i_0_14, plain, (ld(X1,mult(X1,X2))=X2)).
% 35.27/4.85 cnf(i_0_13, plain, (mult(X1,ld(X1,X2))=X2)).
% 35.27/4.85 cnf(i_0_15, plain, (mult(rd(X1,X2),X2)=X1)).
% 35.27/4.85 cnf(i_0_16, plain, (rd(mult(X1,X2),X2)=X1)).
% 35.27/4.85 cnf(i_0_20, plain, (mult(i(X1),mult(X1,X2))=X2)).
% 35.27/4.85 cnf(i_0_21, plain, (mult(i(X1),i(X2))=i(mult(X1,X2)))).
% 35.27/4.85 cnf(i_0_19, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))).
% 35.27/4.85 cnf(i_0_24, negated_conjecture, (mult(op_c,op_d)!=mult(op_d,op_c))).
% 35.27/4.85 cnf(i_0_26, plain, (X4=X4)).
% 35.27/4.85 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 35.27/4.85 # Begin printing tableau
% 35.27/4.85 # Found 6 steps
% 35.27/4.85 cnf(i_0_22, plain, (mult(op_c,mult(op_c,mult(op_c,op_c)))=unit), inference(start_rule)).
% 35.27/4.85 cnf(i_0_34, plain, (mult(op_c,mult(op_c,mult(op_c,op_c)))=unit), inference(extension_rule, [i_0_32])).
% 35.27/4.85 cnf(i_0_61, plain, (mult(op_c,mult(op_c,mult(op_c,op_c)))!=unit), inference(closure_rule, [i_0_22])).
% 35.27/4.85 cnf(i_0_60, plain, (rd(mult(op_c,mult(op_c,mult(op_c,op_c))),mult(op_c,mult(op_c,mult(op_c,op_c))))=rd(unit,unit)), inference(extension_rule, [i_0_29])).
% 35.27/4.85 cnf(i_0_71, plain, (rd(unit,unit)!=mult(rd(unit,unit),unit)), inference(closure_rule, [i_0_17])).
% 35.27/4.85 cnf(i_0_69, plain, (rd(mult(op_c,mult(op_c,mult(op_c,op_c))),mult(op_c,mult(op_c,mult(op_c,op_c))))=mult(rd(unit,unit),unit)), inference(etableau_closure_rule, [i_0_69, ...])).
% 35.27/4.85 # End printing tableau
% 35.27/4.85 # SZS output end
% 35.27/4.85 # Branches closed with saturation will be marked with an "s"
% 35.84/4.86 # Child (16085) has found a proof.
% 35.84/4.86
% 35.84/4.86 # Proof search is over...
% 35.84/4.86 # Freeing feature tree
%------------------------------------------------------------------------------