TSTP Solution File: GRP727-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP727-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 : n003.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:13 EDT 2022
% Result : Unsatisfiable 166.27s 21.35s
% Output : CNFRefutation 166.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : GRP727-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 22:50:10 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.39 # No SInE strategy applied
% 0.21/0.39 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
% 0.21/0.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.21/0.39 #
% 0.21/0.39 # Presaturation interreduction done
% 0.21/0.39 # Number of axioms: 18 Number of unprocessed: 18
% 0.21/0.39 # Tableaux proof search.
% 0.21/0.39 # APR header successfully linked.
% 0.21/0.39 # Hello from C++
% 0.21/0.39 # The folding up rule is enabled...
% 0.21/0.39 # Local unification is enabled...
% 0.21/0.39 # Any saturation attempts will use folding labels...
% 0.21/0.39 # 18 beginning clauses after preprocessing and clausification
% 0.21/0.39 # Creating start rules for all 1 conjectures.
% 0.21/0.39 # There are 1 start rule candidates:
% 0.21/0.39 # Found 18 unit axioms.
% 0.21/0.39 # 1 start rule tableaux created.
% 0.21/0.39 # 0 extension rule candidate clauses
% 0.21/0.39 # 18 unit axiom clauses
% 0.21/0.39
% 0.21/0.39 # Requested 8, 32 cores available to the main process.
% 0.21/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.39 # Creating equality axioms
% 0.21/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.21/0.39 # Returning from population with 27 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.39 # We now have 27 tableaux to operate on
% 166.27/21.35 # There were 1 total branch saturation attempts.
% 166.27/21.35 # There were 0 of these attempts blocked.
% 166.27/21.35 # There were 0 deferred branch saturation attempts.
% 166.27/21.35 # There were 0 free duplicated saturations.
% 166.27/21.35 # There were 1 total successful branch saturations.
% 166.27/21.35 # There were 0 successful branch saturations in interreduction.
% 166.27/21.35 # There were 0 successful branch saturations on the branch.
% 166.27/21.35 # There were 1 successful branch saturations after the branch.
% 166.27/21.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 166.27/21.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 166.27/21.35 # Begin clausification derivation
% 166.27/21.35
% 166.27/21.35 # End clausification derivation
% 166.27/21.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 166.27/21.35 cnf(i_0_23, plain, (mult(X1,unit)=X1)).
% 166.27/21.35 cnf(i_0_22, plain, (mult(unit,X1)=X1)).
% 166.27/21.35 cnf(i_0_24, plain, (mult(X1,i(X1))=unit)).
% 166.27/21.35 cnf(i_0_25, plain, (mult(i(X1),X1)=unit)).
% 166.27/21.35 cnf(i_0_29, plain, (mult(rd(X1,X2),X2)=X1)).
% 166.27/21.35 cnf(i_0_28, plain, (rd(mult(X1,X2),X2)=X1)).
% 166.27/21.35 cnf(i_0_27, plain, (mult(i(X1),mult(X1,X2))=X2)).
% 166.27/21.35 cnf(i_0_41, plain, (asoc(asoc(X1,X2,X3),X4,X5)=unit)).
% 166.27/21.35 cnf(i_0_26, plain, (mult(i(X1),i(X2))=i(mult(X1,X2)))).
% 166.27/21.35 cnf(i_0_30, plain, (mult(mult(X1,mult(X2,X1)),X3)=mult(X1,mult(X2,mult(X1,X3))))).
% 166.27/21.35 cnf(i_0_31, plain, (mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3))=mult(mult(X1,X2),X3))).
% 166.27/21.35 cnf(i_0_38, plain, (rd(mult(mult(mult(i(X1),mult(X2,X1)),X3),X4),mult(X3,X4))=mult(i(X1),mult(rd(mult(mult(X2,X3),X4),mult(X3,X4)),X1)))).
% 166.27/21.35 cnf(i_0_36, plain, (rd(mult(mult(mult(i(mult(X1,X2)),mult(X1,mult(X2,X3))),X4),X5),mult(X4,X5))=mult(i(mult(X1,X2)),mult(X1,mult(X2,rd(mult(mult(X3,X4),X5),mult(X4,X5))))))).
% 166.27/21.35 cnf(i_0_40, plain, (mult(i(X1),mult(mult(i(X2),mult(X3,X2)),X1))=mult(i(X2),mult(mult(i(X1),mult(X3,X1)),X2)))).
% 166.27/21.35 cnf(i_0_39, plain, (mult(i(X1),mult(mult(i(mult(X2,X3)),mult(X2,mult(X3,X4))),X1))=mult(i(mult(X2,X3)),mult(X2,mult(X3,mult(i(X1),mult(X4,X1))))))).
% 166.27/21.35 cnf(i_0_35, plain, (rd(mult(mult(rd(mult(mult(X1,X2),X3),mult(X2,X3)),X4),X5),mult(X4,X5))=rd(mult(mult(rd(mult(mult(X1,X4),X5),mult(X4,X5)),X2),X3),mult(X2,X3)))).
% 166.27/21.35 cnf(i_0_37, plain, (mult(i(mult(X1,X2)),mult(X1,mult(X2,mult(i(mult(X3,X4)),mult(X3,mult(X4,X5))))))=mult(i(mult(X3,X4)),mult(X3,mult(X4,mult(i(mult(X1,X2)),mult(X1,mult(X2,X5)))))))).
% 166.27/21.35 cnf(i_0_42, negated_conjecture, (asoc(a,b,asoc(c,d,e))!=unit)).
% 166.27/21.35 cnf(i_0_44, plain, (X6=X6)).
% 166.27/21.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 166.27/21.35 # Begin printing tableau
% 166.27/21.35 # Found 7 steps
% 166.27/21.35 cnf(i_0_23, plain, (mult(X7,unit)=X7), inference(start_rule)).
% 166.27/21.35 cnf(i_0_52, plain, (mult(X7,unit)=X7), inference(extension_rule, [i_0_51])).
% 166.27/21.35 cnf(i_0_87, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_23])).
% 166.27/21.35 cnf(i_0_88, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_23])).
% 166.27/21.35 cnf(i_0_86, plain, (asoc(mult(X3,unit),mult(X5,unit),mult(X7,unit))=asoc(X3,X5,X7)), inference(extension_rule, [i_0_47])).
% 166.27/21.35 cnf(i_0_96, plain, (asoc(X3,X5,X7)!=mult(asoc(X3,X5,X7),unit)), inference(closure_rule, [i_0_23])).
% 166.27/21.35 cnf(i_0_94, plain, (asoc(mult(X3,unit),mult(X5,unit),mult(X7,unit))=mult(asoc(X3,X5,X7),unit)), inference(etableau_closure_rule, [i_0_94, ...])).
% 166.27/21.35 # End printing tableau
% 166.27/21.35 # SZS output end
% 166.27/21.35 # Branches closed with saturation will be marked with an "s"
% 166.27/21.41 # Child (18586) has found a proof.
% 166.27/21.41
% 166.27/21.41 # Proof search is over...
% 166.27/21.41 # Freeing feature tree
%------------------------------------------------------------------------------